Titlebook: String Processing and Information Retrieval; 9th International Sy Alberto H. F. Laender,Arlindo L. Oliveira Conference proceedings 2002 Spr

裂隙

abduction

On the Size of DASG for Multiple TextsWe present a left-to-right algorithm building the automaton accepting all subsequences of a given set of strings. We prove that the number of states of this automaton can be quadratic if built on at least two texts.

Adherent

garrulous

978-3-540-44158-8Springer-Verlag Berlin Heidelberg 2002

Addictive

String Processing and Information Retrieval978-3-540-45735-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

优雅

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/879703.jpg

不规则

Creatinine-Test

String Matching Problems from Bioinformatics Which Still Need Better Solutionssearching community. We will describe two problems arising from Bioinformatics, their preliminary solutions, and the more general problem that they pose. We hope that this will encourage researchers to find better, general, algorithms to solve these problems.

LATER

Pattern Matching over Multi-attribute Data Streamslgorithms that generalize string-matching algorithms for detecting patterns with complex predicates over data streams having multiple categorical and quantitative attributes. Implementation and evaluation of the algorithms show their efficiency when compared to the naive approach.

渗入