81 search results - page 8 / 17 » Repetition-free longest common subsequence |
76
Voted
NAACL
2001
14 years 11 months ago
2001
I present a method of identifying cognates in the vocabularies of related languages. I show that a measure of phonetic similarity based on multivalued features performs better tha...
CIBCB
2007
IEEE
15 years 3 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
70
Voted
DEXAW
2002
IEEE
15 years 2 months ago
2002
IEEE
We investigate techniques for similarity analysis of spatio-temporal trajectories for mobile objects. Such kind of data may contain a great amount of outliers, which degrades the ...
79
Voted
EMNLP
2009
14 years 7 months ago
2009
We present a method for detecting and correcting multiple real-word spelling errors using the Google Web 1T 3-gram data set and a normalized and modified version of the Longest Co...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of t...