WANG Jia-ying， WANG Bin， LI Xiao-hua， YANG Xiao-chun. Multi-core Parallel Substring Matching Algorithm Using BWT[J]. Journal of Northeastern University Natural Science, 2016, 37(5): 624-628.
[1]Navarro G，Mkinen V.Compressed full-text indexes［J］.ACM Computing Surveys (CSUR)，2007，39(1):2-50. [2]Yang X，Wang B，Li C，et al.Efficient direct search on compressed genomic data［C］//IEEE 29th International Conference on Data Engineering (ICDE).Brisbane，2013:961-972. [3]Li H，Durbin R.Fast and accurate short read alignment with Burrows-Wheeler transform［J］.Bioinformatics，2009，25(14):1754-1760. [4]Li R，Yu C，Li Y，et al.SOAP2:an improved ultrafast tool for short read alignment［J］.Bioinformatics，2009，25(15):1966-1967. [5]Wandelt S，Deng D，Gerdjikov S，et al.State-of-the-art in string similarity search and join［J］.ACM SIGMOD Record，2014，43(1):64-76. [6]Jiang Y，Li G，Feng J，et al.String similarity joins:an experimental evaluation［J］.Proceedings of the VLDB Endowment，2014，7(8):625-636. [7]Ferragina P，Manzini G.Opportunistic data structures with applications［C］//Proceedings 41st Annual Symposium on Foundations of Computer Science.Redondo，2000:390-398. [8]Manzini G，Ferragina P.Engineering a lightweight suffix array construction algorithm［J］.Algorithmica，2004，40(1):33-50. [9]Crauser A，Ferragina P.A theoretical and experimental study on the construction of suffix arrays in external memory［J］.Algorithmica，2002，32(1):1-35. [10]Dementiev R，Krkkinen J，Mehnert J，et al.Better external memory suffix array construction［J］.Journal of Experimental Algorithmics，2008，12(1):3-27. [11]Wang J，Yang X，Wang B，et al.Memory-aware BWT by segmenting sequences to support subsequence search［C］//Asia-Pacific Web Conference.Kunming，2012:73-84.
