Sciweavers

14 search results - page 2 / 3
» recomb 2000
Sort
View
RECOMB
2000
Springer
13 years 8 months ago
Early eukaryote evolution based on mitochondrial gene order breakpoints
We present a general heuristicfor the median problem for induced breakpoints on genomes with unequal gene content and incorporate this into a routine for estimating optimal gene o...
David Sankoff, David Bryant, Mélanie Deneau...
RECOMB
2000
Springer
13 years 8 months ago
A compression algorithm for DNA sequences and its applications in genome comparison
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
Xin Chen, Sam Kwong, Ming Li
RECOMB
2000
Springer
13 years 8 months ago
Universal DNA tag systems: a combinatorial design scheme
Custom-designed DNA arrays offer the possibility of simultaneously monitoring thousands of hybridization reactions. These arrays show great potential for many medical and scientif...
Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, ...
RECOMB
2001
Springer
14 years 5 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
RECOMB
2000
Springer
13 years 8 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal