Sciweavers

5 search results - page 1 / 1
» The Median Problem for the Reversal Distance in Circular Bac...
Sort
View
JDA
2007
156views more  JDA 2007»
13 years 4 months ago
A linear time algorithm for the inversion median problem in circular bacterial genomes
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathri...
CPM
2005
Springer
89views Combinatorics» more  CPM 2005»
13 years 10 months ago
The Median Problem for the Reversal Distance in Circular Bacterial Genomes
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathri...
TCS
2011
12 years 11 months ago
The transposition median problem is NP-complete
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...
Martin Bader
BMCBI
2006
192views more  BMCBI 2006»
13 years 4 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 8 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