1972 search results - page 172 / 395 » Evolutionary algorithms and dynamic programming |
119
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
119
Voted
ICPP
2003
IEEE
15 years 7 months ago
2003
IEEE
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
246
click to vote
ICDE
2009
IEEE
16 years 4 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
132
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
120
click to vote
ISMIR
2005
Springer
15 years 8 months ago
2005
Springer
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...