Sciweavers

57 search results - page 6 / 12
» Faster algorithms for guided tree edit distance
Sort
View
75
Voted
ALMOB
2008
131views more  ALMOB 2008»
14 years 9 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
15 years 11 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
14 years 1 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
BMCBI
2007
138views more  BMCBI 2007»
14 years 9 months ago
Fast computation of distance estimators
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Isaac Elias, Jens Lagergren
BIBE
2006
IEEE
132views Bioinformatics» more  BIBE 2006»
15 years 3 months ago
Simplicity in RNA Secondary Structure Alignment: Towards biologically plausible alignments
Ribonucleic acid (RNA) molecules contain the genetic information that regulates the functions of organisms. Given two different molecules, a preserved function corresponds to a pr...
Rimon Mikhaiel, Guohui Lin, Eleni Stroulia