Sciweavers

1337 search results - page 5 / 268
» Fast computation of distance estimators
Sort
View
ICDE
2002
IEEE
126views Database» more  ICDE 2002»
14 years 9 months ago
Fast Mining of Massive Tabular Data via Approximate Distance Computations
Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthu...
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung
BMCBI
2010
132views more  BMCBI 2010»
13 years 7 months ago
Protein docking by Rotation-Based Uniform Sampling (RotBUS) with fast computing of intermolecular contact distance and residue d
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...
Albert Solernou, Juan Fernández-Recio
ALMOB
2008
131views more  ALMOB 2008»
13 years 7 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
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 4 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat