Sciweavers

22 search results - page 3 / 5
» Breakpoint Distance and PQ-Trees
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
JCB
2008
144views more  JCB 2008»
13 years 7 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
BMCBI
2010
121views more  BMCBI 2010»
13 years 7 months ago
Reconstructing genome trees of prokaryotes using overlapping genes
Background: Overlapping genes (OGs) are defined as adjacent genes whose coding sequences overlap partially or entirely. In fact, they are ubiquitous in microbial genomes and more ...
Chih-Hsien Cheng, Chung-Han Yang, Hsien-Tai Chiu, ...
RECOMB
2008
Springer
14 years 7 months ago
Internal Validation of Ancestral Gene Order Reconstruction in Angiosperm Phylogeny
Abstract. Whole genome doubling (WGD), a frequent occurrence during the evolution of the angiopsperms, complicates ancestral gene order reconstruction due to the multiplicity of so...
David Sankoff, Chunfang Zheng, P. Kerr Wall, Claud...
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
13 years 12 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret