共 50 条
- [1] The efficient computation of complete and concise substring scales with suffix trees [J]. Formal Concept Analysis, Proceedings, 2007, 4390 : 98 - 113
- [2] On the use of suffix trees in multiple sequence alignment [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2005, 230 : U1326 - U1326
- [3] Grammatical inference using suffix trees [J]. GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 163 - 174
- [4] Malware clustering using suffix trees [J]. JOURNAL OF COMPUTER VIROLOGY AND HACKING TECHNIQUES, 2016, 12 (01): : 1 - 10
- [6] On Suffix Extensions in Suffix Trees [J]. STRING PROCESSING AND INFORMATION RETRIEVAL, 2011, 7024 : 301 - +
- [8] Efficient Computation of Substring Equivalence Classes with Suffix Arrays [J]. Algorithmica, 2017, 79 : 291 - 318
- [9] Efficient computation of substring equivalence classes with suffix arrays [J]. COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 340 - +