Sciweavers

84 search results - page 9 / 17
» On the Approximability of Comparing Genomes with Duplicates
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 months ago
Validation of an NSP-based (negative selection pattern) gene family identification strategy
Background: Gene family identification from ESTs can be a valuable resource for analysis of genome evolution but presents unique challenges in organisms for which the entire genom...
Ronald L. Frank, Cyriac Kandoth, Fikret Erç...
RECOMB
2000
Springer
13 years 11 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
2005
Springer
14 years 8 months ago
A Framework for Orthology Assignment from Gene Rearrangement Data
Abstract. Gene rearrangements have been used successfully in phylogenetic reconstruction and comparative genomics, but usually under the assumption that all genomes have the same g...
Krister M. Swenson, Nicholas D. Pattengale, Bernar...
ISMB
2007
13 years 10 months ago
Automatic genome-wide reconstruction of phylogenetic gene trees
Gene duplication and divergence is a major evolutionary force. Despite the growing number of fully sequenced genomes, methods for investigating these events on a genome-wide scale...
Ilan Wapinski, Avi Pfeffer, Nir Friedman, Aviv Reg...
ASPLOS
2006
ACM
14 years 1 months ago
Understanding prediction-based partial redundant threading for low-overhead, high- coverage fault tolerance
Redundant threading architectures duplicate all instructions to detect and possibly recover from transient faults. Several lighter weight Partial Redundant Threading (PRT) archite...
Vimal K. Reddy, Eric Rotenberg, Sailashri Parthasa...