Sciweavers

198 search results - page 25 / 40
» Efficient computation of absent words in genomic sequences
Sort
View
ECCV
2010
Springer
14 years 10 months ago
Efficient Computation of Scale-Space Features for Deformable Shape Correspondences
Abstract. With the rapid development of fast data acquisition techniques, 3D scans that record the geometric and photometric information of deformable objects are routinely acquire...
Tingbo Hou, Hong Qin
RECOMB
1999
Springer
15 years 2 months ago
Evolution of metabolisms: a new method for the comparison of metabolic pathways
The abundance of information provided by completely sequenced genomes de nes a starting point for new insights in the multilevel organization of organisms and their evolution. At ...
Christian V. Forst, Klaus Schulten
86
Voted
RECOMB
2010
Springer
14 years 7 months ago
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
Jean-Philippe Doyon, Celine Scornavacca, K. Yu. Go...
JCB
2008
75views more  JCB 2008»
14 years 9 months ago
New, Improved, and Practical k-Stem Sequence Similarity Measures for Probe Design
We define new measures of sequence similarity for oligonucleotide probe design. These new measures incorporate the nearest neighbor k-stem motifs in their definition, but can be e...
Anthony J. Macula, Alexander Schliep, Morgan A. Bi...
BMCBI
2011
14 years 1 months ago
A Novel And Well-Defined Benchmarking Method For Second Generation Read Mapping
Background: Second generation sequencing technologies yield DNA sequence data at ultra high-throughput. Common to most biological applications is a mapping of the reads to an almo...
Manuel Holtgrewe, Anne-Katrin Emde, David Weese, K...