63 search results - page 3 / 13 » A sublinear algorithm for weakly approximating edit distance |
111
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
67
Voted
EUROGP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
VLDB
2007
ACM
15 years 3 months ago
2007
ACM
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
78
Voted
JEA
2008
14 years 9 months ago
2008
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...