Sciweavers

2489 search results - page 42 / 498
» On the Subgroup Distance Problem
Sort
View
DAWAK
2000
Springer
15 years 5 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
103
Voted
KELSI
2004
Springer
15 years 6 months ago
A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dav...
75
Voted
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 7 months ago
On Approximating the Average Distance Between Points
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
Kfir Barhum, Oded Goldreich, Adi Shraibman
94
Voted
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 2 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
91
Voted
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
15 years 7 months ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough