Sciweavers

3270 search results - page 34 / 654
» Approximate String Processing
Sort
View
RECOMB
2007
Springer
14 years 8 months ago
Production-Passage-Time Approximation: A New Approximation Method to Accelerate the Simulation Process of Enzymatic Reactions
Abstract. Given the substantial computational requirements of stochastic simulation, approximation is essential for efficient analysis of any realistic biochemical system. This pap...
Hiroyuki Kuwahara, Chris J. Myers
JDA
2007
73views more  JDA 2007»
13 years 7 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...
SOFSEM
2010
Springer
14 years 4 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
VLDB
2007
ACM
105views Database» more  VLDB 2007»
14 years 1 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
COLING
1996
13 years 9 months ago
Segmenting Sentences into Linky Strings Using D-bigram Statistics
It is obvious that segmentation takes an important role in natural language processing(NLP), especially for the languages whose sentences are not easily separated into morphemes. ...
Shiho Nobesawa, Junya Tsutsumi, Sun Da Jiang, Tomo...