TY - JOUR AU - Feijão, Pedro AU - Araujo, Eloi PY - 2016 DA - 2016/11/11 TI - Fast ancestral gene order reconstruction of genomes with unequal gene content JO - BMC Bioinformatics SP - 413 VL - 17 IS - 14 AB - During evolution, genomes are modified by large scale structural events, such as rearrangements, deletions or insertions of large blocks of DNA. Of particular interest, in order to better understand how this type of genomic evolution happens, is the reconstruction of ancestral genomes, given a phylogenetic tree with extant genomes at its leaves. One way of solving this problem is to assume a rearrangement model, such as Double Cut and Join (DCJ), and find a set of ancestral genomes that minimizes the number of events on the input tree. Since this problem is NP-hard for most rearrangement models, exact solutions are practical only for small instances, and heuristics have to be used for larger datasets. This type of approach can be called event-based. Another common approach is based on finding conserved structures between the input genomes, such as adjacencies between genes, possibly also assigning weights that indicate a measure of confidence or probability that this particular structure is present on each ancestral genome, and then finding a set of non conflicting adjacencies that optimize some given function, usually trying to maximize total weight and minimizing character changes in the tree. We call this type of methods homology-based. SN - 1471-2105 UR - https://doi.org/10.1186/s12859-016-1261-9 DO - 10.1186/s12859-016-1261-9 ID - Feijão2016 ER -