Artykuł w czasopiśmie
Brak miniatury
Licencja
Dostęp zamkniętyTaming the Duplication-Loss-Coalescence Model with Integer Linear Programming
| dc.abstract.en | The duplication-loss-coalescence (DLC) parsimony model is invaluable for analyzing the complex scenarios of concurrent duplication loss and deep coalescence events in the evolution of gene families. However, inferring such scenarios for already moderately sized families is prohibitive owing to the computational complexity involved. To overcome this stringent limitation, we make the first step by describing a flexible integer linear programming (ILP) formulation for inferring DLC evolutionary scenarios. Then, to make the DLC model more scalable, we introduce four sensibly constrained versions of the model and describe modified versions of our ILP formulation reflecting these constraints. Our simulation studies showcase that our constrained ILP formulations compute evolutionary scenarios that are substantially larger than scenarios computable under our original ILP formulation and the original dynamic programming algorithm by Wu et al. Furthermore, scenarios computed under our constrained DLC models are remarkably accurate compared with corresponding scenarios under the original DLC model, which we also confirm in an empirical study with thousands of gene families. |
| dc.affiliation | Uniwersytet Warszawski |
| dc.contributor.author | Eulenstein, Oliver |
| dc.contributor.author | Markin, Alexey |
| dc.contributor.author | Paszek, Jarosław |
| dc.contributor.author | Górecki, Paweł |
| dc.date.accessioned | 2024-01-26T09:41:13Z |
| dc.date.available | 2024-01-26T09:41:13Z |
| dc.date.issued | 2021 |
| dc.description.finance | Publikacja bezkosztowa |
| dc.description.number | 8 |
| dc.description.volume | 28 |
| dc.identifier.doi | 10.1089/CMB.2021.0011 |
| dc.identifier.issn | 1066-5277 |
| dc.identifier.uri | https://repozytorium.uw.edu.pl//handle/item/121534 |
| dc.identifier.weblink | http://dx.doi.org/10.1089/cmb.2021.0011 |
| dc.language | eng |
| dc.pbn.affiliation | computer and information sciences |
| dc.relation.ispartof | Journal of Computational Biology |
| dc.relation.pages | 758-773 |
| dc.rights | ClosedAccess |
| dc.sciencecloud | nosend |
| dc.subject.en | coalescence |
| dc.subject.en | DLC |
| dc.subject.en | duplications |
| dc.subject.en | ILP |
| dc.subject.en | losses |
| dc.subject.en | phylogenetics |
| dc.subject.en | reconciliation |
| dc.title | Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming |
| dc.type | JournalArticle |
| dspace.entity.type | Publication |