516 search results - page 11 / 104 » Sets of k-Independent Strings |
ICANNGA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
SODA
2004
ACM
15 years 12 days ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
PSB
2003
15 years 12 days ago
2003
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
104
click to vote
SPIRE
2010
Springer
14 years 9 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
DASFAA
2009
IEEE
15 years 5 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...