共 50 条
- [21] Parallel construction of large suffix trees on a PC cluster EURO-PAR 2005 PARALLEL PROCESSING, PROCEEDINGS, 2005, 3648 : 1227 - 1236
- [22] A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2021, E104D (03): : 381 - 388
- [23] Optimal lightweight construction of suffix Arrays for constant alphabets ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 613 - +
- [24] A bit-parallel approach to suffix automata: Fast extended string matching COMBINATORIAL PATTERN MATCHING, 1998, 1448 : 14 - 33
- [25] Sparse Suffix Tree Construction in Optimal Time and Space PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 425 - 439
- [27] String Suffix Automata and Subtree Pushdown Automata PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009, 2009, : 160 - 172
- [28] Minimal forbidden words and factor automata MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 665 - 673
- [30] MapReduce based Parallel Suffix Tree Construction for Human Genome 2014 20TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2014, : 664 - 670