Linearization of ancestral multichromosomal genomes

• Published in: BMC bioinformatics Vol. 13; no. Suppl 19; p. S11
• Main Authors: Maňuch, Ján, Patterson, Murray, Wittler, Roland, Chauve, Cedric, Tannier, Eric
• Format: Journal Article
• Language: English
• Published: London BioMed Central 2012; Springer Nature B.V
• Subjects: Algorithms; Biochemistry, Molecular Biology; Bioinformatics; Biomedical and Life Sciences; Chromosomes; Chromosomes - genetics; Computational Biology/Bioinformatics; Computer Appl. in Life Sciences; Computer Science; Evolution, Molecular; Genome - genetics; Genomics; Genomics - methods; Life Sciences; Microarrays; Proceedings; Quantitative Methods; Studies; Satisfying Assignment; Span Subgraph; Ancestral Genome; Disjoint Cycle; Graph Covering
• ISSN: 1471-2105; 1471-2105
• DOI: 10.1186/1471-2105-13-S19-S11

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.