Algorithms for reconstruction of chromosomal structures

Background One of the main aims of phylogenomics is the reconstruction of objects defined in the leaves along the whole phylogenetic tree to minimize the specified functional, which may also include the phylogenetic tree generation. Such objects can include nucleotide and amino acid sequences, chrom...

Full description

Saved in:
Bibliographic Details
Published in:BMC bioinformatics Vol. 17; no. 1; p. 40
Main Authors: Lyubetsky, Vassily, Gershgorin, Roman, Seliverstov, Alexander, Gorbunov, Konstantin
Format: Journal Article
Language:English
Published: London BioMed Central 19.01.2016
Subjects:
Algorithms
Bioinformatics
Biomedical and Life Sciences
Chromosome Structures - chemistry
Comparative genomics
Computational Biology - methods
Computational Biology/Bioinformatics
Computer Appl. in Life Sciences
Computer Simulation
Life Sciences
Microarrays
Models, Molecular
Phylogeny
Research Article
Software
Lowest weight transformation of one chromosome structure into another
Generation of a phylogenetic tree of chromosomal structures
Rearrangement of chromosomal structure
Ancestral chromosomal structure
Distance between chromosomal structures
Exact linear algorithm calculating the distance and transformation
Exact reconstruction algorithm with cubic complexity
Chromosomal structure
ISSN:1471-2105, 1471-2105
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Background One of the main aims of phylogenomics is the reconstruction of objects defined in the leaves along the whole phylogenetic tree to minimize the specified functional, which may also include the phylogenetic tree generation. Such objects can include nucleotide and amino acid sequences, chromosomal structures, etc. The structures can have any set of linear and circular chromosomes, variable gene composition and include any number of paralogs, as well as any weights of individual evolutionary operations to transform a chromosome structure. Many heuristic algorithms were proposed for this purpose, but there are just a few exact algorithms with low (linear, cubic or similar) polynomial computational complexity among them to our knowledge. The algorithms naturally start from the calculation of both the distance between two structures and the shortest sequence of operations transforming one structure into another. Such calculation per se is an NP-hard problem. Results A general model of chromosomal structure rearrangements is considered. Exact algorithms with almost linear or cubic polynomial complexities have been developed to solve the problems for the case of any chromosomal structure but with certain limitations on operation weights. The computer programs are tested on biological data for the problem of mitochondrial or plastid chromosomal structure reconstruction. To our knowledge, no computer programs are available for this model. Conclusions Exactness of the proposed algorithms and such low polynomial complexities were proved. The reconstructed evolutionary trees of mitochondrial and plastid chromosomal structures as well as the ancestral states of the structures appear to be reasonable.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1471-2105
1471-2105
DOI:10.1186/s12859-016-0878-z