67 search results - page 5 / 14 » Common Substrings in Random Strings |
PSB
2003
13 years 11 months 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...
TCS
2008
13 years 9 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
DIS
2001
Springer
14 years 2 months ago
2001
Springer
Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimiza...
CRYPTO
2007
Springer
14 years 4 months ago
2007
Springer
The common random string model introduced by Blum, Feldman and Micali permits the construction of cryptographic protocols that are provably impossible to realize in the standard m...
NIPS
2008
13 years 11 months ago
2008
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of parallel string pairs. SCFGs can model equivalence between strings in terms of su...