Linearization of ancestral multichromosomal genomes

Manuch J, Patterson M, Wittler R, Chauve C, Tannier E (2012)
BMC Bioinformatics 13(Proc. of RECOMB-CG 2012).

Zeitschriftenaufsatz | Veröffentlicht | Englisch

Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Autor/in
; ; ; ;
Abstract / Bemerkung
Background: Recovering the structure of ancestral genomes can be formalized in terms of properties of binary matrices such as the Consecutive-Ones Property (C1P). The Linearization Problem asks to extract, from a given binary matrix, a maximum weight subset of rows that satisfies such a property. This problem is in general intractable, and in particular if the ancestral genome is expected to contain only linear chromosomes or a unique circular chromosome. In the present work, we consider a relaxation of this problem, which allows ancestral genomes that can contain several chromosomes, each either linear or circular. Result: We show that, when restricted to binary matrices of degree two, which correspond to adjacencies, the genomic characters used in most ancestral genome reconstruction methods, this relaxed version of the Linearization Problem is polynomially solvable using a reduction to a matching problem. This result holds in the more general case where columns have bounded multiplicity, which models possibly duplicated ancestral genes. We also prove that for matrices with rows of degrees 2 and 3, without multiplicity and without weights on the rows, the problem is NP-complete, thus tracing sharp tractability boundaries. Conclusion: As it happened for the breakpoint median problem, also used in ancestral genome reconstruction, relaxing the definition of a genome turns an intractable problem into a tractable one. The relaxation is adapted to some biological contexts, such as bacterial genomes with several replicons, possibly partially assembled. Algorithms can also be used as heuristics for hard variants. More generally, this work opens a way to better understand linearization results for ancestral genome structure inference.
Erscheinungsjahr
2012
Zeitschriftentitel
BMC Bioinformatics
Band
13
Ausgabe
Proc. of RECOMB-CG 2012
ISSN
1471-2105
Page URI
https://pub.uni-bielefeld.de/record/2553300

Zitieren

Manuch J, Patterson M, Wittler R, Chauve C, Tannier E. Linearization of ancestral multichromosomal genomes. BMC Bioinformatics. 2012;13(Proc. of RECOMB-CG 2012).
Manuch, J., Patterson, M., Wittler, R., Chauve, C., & Tannier, E. (2012). Linearization of ancestral multichromosomal genomes. BMC Bioinformatics, 13(Proc. of RECOMB-CG 2012). doi:10.1186/1471-2105-13-S19-S11
Manuch, J., Patterson, M., Wittler, R., Chauve, C., and Tannier, E. (2012). Linearization of ancestral multichromosomal genomes. BMC Bioinformatics 13.
Manuch, J., et al., 2012. Linearization of ancestral multichromosomal genomes. BMC Bioinformatics, 13(Proc. of RECOMB-CG 2012).
J. Manuch, et al., “Linearization of ancestral multichromosomal genomes”, BMC Bioinformatics, vol. 13, 2012.
Manuch, J., Patterson, M., Wittler, R., Chauve, C., Tannier, E.: Linearization of ancestral multichromosomal genomes. BMC Bioinformatics. 13, (2012).
Manuch, Jan, Patterson, Murray, Wittler, Roland, Chauve, Cedric, and Tannier, Eric. “Linearization of ancestral multichromosomal genomes”. BMC Bioinformatics 13.Proc. of RECOMB-CG 2012 (2012).

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®

Quellen

PMID: 23281593
PubMed | Europe PMC