Average-case analysis of approximate trie search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3109, Issue , 2004, Pages 472-483

  Maaß, Moritz G ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; HAMMING DISTANCE; PATTERN MATCHING; STRUCTURAL OPTIMIZATION;

ASYMPTOTIC BEHAVIORS; AVERAGE-CASE ANALYSIS; AVERAGE-CASE COMPLEXITY; EXTENDED ABSTRACTS; LOOKUP TIME; MEMORYLESS SOURCE; RUNNING TIME; TRIE DATA STRUCTURES;

ERRORS;

EID: 33745603777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_36     Document Type: Article

References (28)

1. A. Apostolico and W. Szpankowski. Self-alignments in words and their applications. Journal of Algorithms, 13:446-467, 1992.
2. R. A. Baeza-Yates and G. H. Gonnet. Fast text searching for regular expressions or automaton searching on tries. Journal of the ACM, 43(6):915-936, 1996.
3. R. A. Baeza-Yates and G. H. Gonnet. A fast algorithm on average for all-against-all sequence matching. In String Processing and Information Retrieval Symp. SPIRE, pages 16-23. IEEE, 1999.
4. R. D. L. Briandais. File searching using variable length keys. In Proc. of the Western Joint Computer Conference, pages 295-298, March 1959.
5. A. Buchner and H. Täubig. A fast method for motif detection and searching in a protein structure database. Technical Report TUM-I0314, Fakultät für Informatik, TU München, September 2003.
6. A. Buchner, H. Täubig, and J. Griebsch. A fast method for motif detection and searching in a protein structure database. In Proceedings of the German Conference on Bioinformatics (GCB'03), volume 2, pages 186-188, October 2003.
7. A. L. Cobbs. Fast approximate matching using suffix trees. In Proc. of the 6th Sym. on Combinatorial Pattern Matching (CPM), volume 937 of LNCS, pages 41-54. Springer, 1995.
8. J. L. Fields. The uniform asymptotic expansion of a ratio of Gamma functions. In Proc. of the Int. Conf. on Constructive Function Theory, pages 171-176, Varna, May 1970.
9. P. Flajolet and C. Puech. Partial match retrieval of multidimensional data. J. ACM, 33(2):371-407, 1986.
10. E. Fredkin. Trie memory. Communications of the ACM, 3(9):490-499, 1960.
11. P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In Proc. of the 16th Int'l Symp. on Mathematical Foundations of Computer Science (MFCS), volume 520 of LNCS, pages 240-248. Springer, 1991.
12. P. Kirschenhofer. A note on alternating sums. Electronic Journal of Combinatorics, 3(2), 1996.
13. D. E. Knuth. The Art of Computer Programming - Sorting and Searching, volume 3. Addison Wesley, 2nd edition, February 1998.
14. M. G. Maaß. Average-case analysis of approximate trie search. Technical Report TUM-I0405, Fakultät für Informatik, TU München, March 2004.
15. D. R. Morrison. PATRICIA - practical algorithm to retrieve information coded in alphanumeric. J. of the ACM, 15(4):514-534, October 1968.
16. G. Navarro. Approximate Text Searching. PhD thesis, University of Chile, Dept. of Computer Science, University of Chile, Santiago, Chile, 1998.
17. G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms (JDA), 1(1):205-209, 2000. Special Issue on Matching Patterns.
18. N. E. Nörlund. Vorlesungen über Differenzenrechnung. Springer, Berlin, 1924.
19. K. Oflazer. Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Computer Linguist, 22(1):73-89, 1996.
20. B. Pittel. Paths in a random digital tree: Limiting distributions. Adv. Appl. Prob., 18:139-155, 1986.
21. H. Prodinger and W. Szpankowski (Guest Editors). Theoretical Computer Science. Elsevier, 144(1-2) (Special Issue), 1995.
22. K. U. Schulz and S. Mihov. Fast string correction with Levenshtein automata. Int. J. on Document Analysis and Recognition (IJDAR), 5:67-85, 2002.
23. W. Szpankowski. The evaluation of an alternative sum with applications to the analysis of some data structures. Information Processing Letters, 28:13-19, 1988.
24. W. Szpankowski. Some results on v-ary asymmetric tries. J. of Algorithms, 9:224-244, 1988.
25. W. Szpankowski. Average Case Analysis of Algorithms on Sequences. Wiley-Interscience, 1st edition, 2000.
26. F. G. Tricomi and A. Erdélyi. The asymptotic expansion of a ratio of Gamma functions. Pacific J. of Mathematics, 1:133-142, 1951.
27. E. Ukkonen. Approximate string-matching over suffix trees. In Proc. of the 4th Sym. on Combinatorial Pattern Matching (CPM), volume 684 of LNCS, pages 228-242. Springer, 1993.
28. F. A. O. Werner, G. Durstewitz, F. A. Habermann, G. Thaller, W. Krämer, S. Kollers, J. Buitkamp, M. Georges, G. Brem, J. Mosner, and R. Fries. Detection and characterization of SNPs useful for identity control and parentage testing in major European dairy breeds. Animal Genetics, to appear, 2003.