Alberto Apostolico, Maxime Crochemore  Home/Search
Context Related
Links: ACM | igm.univmlv.fr/~mac/REC...00surkit.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: igm.univmlv.fr/~m...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: String Pattern Matching concerns itself with algorithmic and combinatorial issues related to matching and searching on linearly arranged sequences of symbols, arguably the simplest possible discrete structures. As unprecedented volumes of sequence data are amassed, disseminated and shared at an increasing pace, effective access to, and manipulation of such data depend crucially on the efficiency with which strings are structured, compressed, transmitted, stored, searched and retrieved. This... (Update)
Context of citations to this paper: More
.... of the current top performing software for molecular database searches are engineered around these ideas [27, 28, 29, 30] A survey may be found in [31]. 16 0 6 1 2 3 4 5 6 0 7 5 8 9 10 11 1 12 13 2 14 4 15 3 a b b a b b b b a b b b b b b Figure 3: Sux trie of ababbb. 3.3...
Cited by: More
Motifs in Sequences: Localization and Extraction - Crochemore, Sagot (2000) (Correct)
Active bibliography (related documents): More All
1.3: Text Compression Using Antidictionaries - Crochemore, Mignosi, Restivo.. (1998) (Correct)
1.0: Data Compression Using Antidictionaries - Crochemore, Mignosi, Restivo.. (2000) (Correct)
0.8: Efficient String Matching on Coded Texts - Breslauer, Gasieniec (1994) (Correct)
Similar documents based on text: More All
0.3: Approximate String Matching with Gaps - Crochemore, Iliopoulos, al. (2004) (Correct)
0.2: Tight bounds on the complexity of the Apostolico-Giancarlo.. - Crochemore, Lecroq (1997) (Correct)
0.2: An Optimal O(log log n) Time Parallel Algorithm for.. - Apostolico, Breslauer (1995) (Correct)
BibTeX entry: (Update)
A. Apostolico and M. Crochemore. String pattern matching for a deluge survival kit. In Handbook of Massive Data Sets, J. Abello, P.M. Pardalos and M.G.C. Resende, eds., Kluwer Academic Publishers, 2000) to appear. http://citeseer.ist.psu.edu/apostolico00string.html More
@incollection{ apostolico00string,
author = "A. Apostolico and M. Crochemore",
title = "String pattern matching for a deluge survival kit",
booktitle = "Handbook of Massive Data Sets",
editor = "J. Abello, P.M. Pardalos and M.G.C. Resende",
publisher = "Kluwer Academic Publishers",
year = "2000",
url = "citeseer.ist.psu.edu/apostolico00string.html" }
Citations (may not include all citations):921 Mining association rules between sets of items in large data.. - Agrawal, Imielinski et al. - 1993 ACM DBLP
368 Text Compression (context) - Bell, Cleary et al. - 1990
347 Fast Pattern Matching in Strings (context) - Knuth, Morris et al. - 1977 DBLP
204 Oxford University Press (context) - Crochemore, Rytter - 1994
180 Binary codes capable of correcting deletions (context) - Levenshtein - 1966
159 Three approaches to the quantitative definition of informati.. (context) - Kolmogorov - 1965
143 A block-sorting lossless data compression algorithm - Burrows, Wheeler - 1994
116 Molecular Biology of the Cell (context) - Alberts, Bray et al. - 1989
89 Efficient Randomized Pattern Matching Algorithms (context) - Karp, Rabin - 1987
81 Error detecting and error correcting codes (context) - Hamming - 1950
61 Let sleeping files lie: pattern matching in Z-compressed fil.. - Amir, Benson et al. - 1994 DBLP
61 Let Sleeping Files Lie: Pattern Matching in Z-Compressed Fil.. - Amir, Farach et al. - 1996 DBLP
56 The Myriad Virtues of Subword Trees (context) - Apostolico - 1985
56 Relations Between Concurrent-write Models of Parallel Comput.. (context) - Fich, Ragde et al. - 1988 ACM DBLP
55 The Smallest Automaton Recognizing the Subwords of a Text (context) - Blumer, Blumer et al. - 1985 DBLP
55 Cambridge University Press (context) - Lothaire, Words - 1997
53 Generalized string matching (context) - Abrahamson - 1987 ACM DBLP
53 Grammatical inference: Introduction and survey -- Part (context) - Fu, Booth - 1975
53 Grammatical inference: Introduction and survey --- Part II (context) - Fu, Booth - 1975
50 An optimal algorithm for computing the repetitions in a word (context) - Crochemore - 1981 DBLP
50 Data compression with finite windows (context) - Fiala, Greene - 1989
49 Approaches to the Automatic Discovery of Patterns in Biosequ.. - Brazma, Jonassen et al. - 1998 DBLP
49 the complexity of finite sequences (context) - Lempel, Ziv - 1976
49 A survey of multiple sequence comparison methods (context) - Chan, Wong et al. - 1992
48 and Statistical Mechanics (context) - Ellis, Large - 1985
45 String matching in Lempel-Ziv compressed strings - Farach, Thorup - 1994 ACM DBLP
43 Uniqueness Theorems for Periodic Functions (context) - Fine, Wilf - 1965
36 Avoidable patterns in strings of symbols (context) - Bean, Ehrenfeucht et al. - 1979
35 Codage Symbolique (context) - B'eal - 1993
35 String matching and other products (context) - Fischer, Paterson - 1974
30 Episode Matching - Das, Fleischer et al. - 1997 ACM DBLP
30 Predicting Gene Regulatory Elements in Silico on a Genomic S.. - Brazma, Jonassen et al. - 1998
28 Transducers and repetitions (context) - Crochemore - 1986
25 Science and Information Theory (context) - Brillouin - 1971
24 Optimal Parallel Algorithms for Periods (context) - Apostolico, Breslauer et al. - 1992
24 A Lower Bound for Parallel String Matching - Breslauer, Galil - 1992 ACM DBLP
23 Optimal off-line detection of repetitions in a string (context) - Apostolico, Preparata - 1983 DBLP
22 Efficient and Elegant Subword-tree Construction (context) - Chen, Seiferas - 1985
21 Self-alignment in words and their applications - Apostolico, Szpankowski - 1992
21 Interscience Publishers (context) - Ash, Tracts - 1985
21 Multi-index hashing for information retrieval (context) - Greene, Parnas et al. - 1994 DBLP
20 Efficient string matching (context) - Aho, Corasick - 1975 ACM
20 Complete Inverted Files for Efficient Text Retrieval and Ana.. (context) - Blumer, Blumer et al. - 1987 ACM DBLP
19 Optimal Superprimitivity Testing for Strings - Apostolico, Farach et al. - 1991 ACM DBLP
18 Text Compression Using Antidictionaries - Crochemore, Mignosi et al. - 1998 ACM DBLP
17 The multiple sequence alignment problem in biology (context) - Carillo, Lipman - 1988 ACM
16 Line String Superprimitivity Test - Breslauer - 1992
16 Optimally Fast Parallel Algorithms for Preprocessing and Pat.. - Cole, Crochemore et al. - 1993 DBLP
16 Fast and practical approximate string matching (context) - Baeza-Yates, Perleberg - 1992 ACM DBLP
15 Finding Maximal Pairs with Bounded Gap - Brodal, Lyngso et al. - 1999 ACM DBLP
15 Minimal Forbidden Words and Symbolic Dynamics - B'eal, Mignosi et al. - 1996 ACM DBLP
15 Van Nostrand Reinhold (context) - Kemeny, Snell et al. - 1960
14 and multiple biological sequence alignment (context) - Altschul, Lipman et al. - 1989
14 A New and Versatile Method for Association Generation - Amir, Feldman et al. - 2000 ACM DBLP
14 Finding all Periods and Initial Palindromes of a String in P.. - Breslauer, Galil - 1995 ACM DBLP
13 Efficient Detection of Quasiperiodicities in Strings (context) - Apostolico, Ehrenfeucht - 1993 ACM DBLP
13 Usefulness of the Karp-MillerRosenberg algorithm in parallel.. (context) - Crochemore, Rytter - 1991
13 Optimal Amnesic Probabilistic Automata or How to Learn and C.. - Apostolico, Bejerano - 2000 ACM DBLP
12 An efficient algorithm for dynamic text indexing (context) - Gu, Farach et al. - 1994 ACM DBLP
12 Minimal Forbidden Words and Factor Automata - Crochemore, Mignosi et al. - 1998 ACM DBLP
10 Extended application of suffix trees to data compression - Larsson - 1996 ACM DBLP
10 Fibonacci Words --- a Survey (context) - Berstel - 1986
10 Simple and Flexible Detection of Contiguous Repeats Using a .. (context) - Gusfield, Stoye DBLP
9 Automata for matching patterns (context) - Crochemore, Hancart - 1997 ACM
9 The effect of non-greedy parsing in Ziv-Lempel compression m.. - Horspool - 1995 ACM DBLP
9 Covering a String (context) - Iliopoulos, Moore et al. - 1993 ACM DBLP
9 Evaluation of General Arithmetic Expressions (context) - Brent - 1974
9 time Algorithm for Parallel Superprimitivity Testing (context) - Iliopoulos, Park et al. - 1994
8 Modeling Protein Families Using Probabilistic Suffix Trees - Bejerano, Yona - 1999 ACM DBLP
8 Data compression using long common strings - Bentley, McIlroy - 1999 ACM DBLP
8 Efficient parallel algorithms to test square-freeness and fa.. (context) - Crochemore, Rytter - 1991 ACM DBLP
8 Information Processing Letters (context) - Crochemore, Mignosi et al. - 1998
8 Optimal Parallel Detection of Squares in Strings (context) - Apostolico - 1992 DBLP
6 Frequently Asked Questions in data compression (context) - Gailly
6 Sublinear expected time approximate string matching and biol.. (context) - Chang, Lawler - 1994
6 Sequence Alignment in Molecular Biology (context) - Apostolico, Giancarlo - 1998
6 Linear Time Algorithms for Finding and Representing all Tand.. - Gusfield, Stoye - 1998
5 Inverse Pattern Matching - Amir, Apostolico et al. - 1997 ACM DBLP
5 On Extendibility of Unavoidable Sets (context) - Choffrut, Culik - 1984 ACM DBLP
5 Efficient Detection of Unusual Words - Apostolico, Bock et al. - 1996 DBLP
5 Repetitions and Covers (context) - Apostolico, Breslauer et al. - 1992
4 Almost optimal fully LZWcompressed pattern matching - Gasieniec, Rytter - 1999
3 String Editing and Longest Common Subsequences - Apostolico - 1996 ACM
3 Data structures and algorithms for the strings stastitics pr.. (context) - Apostolico, Preparata - 1996
3 Data Mining for Regulatory Elements in Yeast Genome - Brazma, Vilo et al. - 1997 ACM DBLP
2 Finite and infinite words (context) - Berstel, Perrin
2 External Inverse Pattern Matching - Gasieniec, Indyk et al. - 1997 ACM DBLP
2 Dynamic Data Structures for String Matching Problems (context) - Ferragina - 1997
1 Computing the Covers of a String in Linear Time (context) - Ben-Amram, Berkman et al. - 1994 ACM DBLP
1 Basic Linear alignment search tool (context) - Altschul, Gish et al. - 1990
1 Optimal Factor Transducers (context) - Crochemore - 1985
1 Ukkonen Pattern Discovery in Biosequences (context) - Brazma, Jonassen et al. - 1998
Documents on the same site (http://www-igm.univ-mlv.fr/~mac/REC/publications.html):
A Fast and Practical Bit-Vector Algorithm for the.. - Crochemore.. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC