1862 search results - page 36 / 373 » Constrained pattern matching |
CPM
2000
Springer
14 years 26 days ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
CPM
1997
Springer
14 years 20 days ago
1997
Springer
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
JCSS
2010
13 years 7 months ago
2010
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
WABI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...