44 search results - page 2 / 9 » Algorithms for Multiple Genome Rearrangement by Signed Rever... |
BMCBI
2008
13 years 5 months ago
2008
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
JDA
2007
13 years 5 months ago
2007
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...
WABI
2005
Springer
13 years 10 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
RECOMB
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
CIBCB
2005
IEEE
13 years 11 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...