44 search results - page 8 / 9 » Algorithms for Multiple Genome Rearrangement by Signed Rever... |
BMCBI
2004
13 years 5 months ago
2004
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
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...
WABI
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
ISMB
1998
13 years 7 months ago
1998
DNA sequence analysis depends on the accurate assembly of fragment reads for the determination of a consensus sequence. This report examines the possibility of analyzing multiple,...
RECOMB
2003
Springer
14 years 6 months ago
2003
Springer
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...