Parallelization of FM-index

Proceedings - 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008

Volumn , Issue , 2008, Pages 169-173

  Zhang, Di ^a   Zhang, Yunquan ^a   Liu, Shengfei ^a   Huang, Xiaodi ^b  

^a INSTITUTE OF SOFTWARE   (China)

^b CHARLES STURT UNIVERSITY   (Australia)

Author keywords

Block processing; FM index; Multi core; Parallel computing; Self index

Indexed keywords

HIGH PERFORMANCE LIQUID CHROMATOGRAPHY;

BLOCK PROCESSING; FM-INDEX; MULTI-CORE; PARALLEL COMPUTING; SELF-INDEX;

PARALLEL PROCESSING SYSTEMS;

EID: 56349138762     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCC.2008.165     Document Type: Conference Paper

References (17)

1. Burrows, M., Wheeler, D.J.: A Block-sorting Lossless Data Compression Algorithm. Digital Systems Research Center Research Report 124 (1994)
2. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In Proc. the 41st IEEE Symposium on Foundations of Computer Science (2000) 390-398
3. Ferragina, P., Manzini, G.: An experimental study of an opportunistic index. In Proc. the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (2001) 269-278
4. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representation of sequences and full-text indexes. Technical Report 2004-05. Technische Fakultät, Universität Bielefeld, Germany (2004)
5. Ferragina, P., Manzini, G., Makinen, V., Navarro, G.: An alphabet-friendly FM-index. In Proc. the 11th International Symposium on String Processing and Information Retrieval. LNCS (2004) 150-160
6. Frakes, W., Baeza-Yates, R.: Information retrieval: data structures and algorithms. Prentice-Hall, Inc. (1992)
7. Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design patterns: elements of reusable object-oriented software. Addison-Wesley Longman Publishing Co., Inc. (1995)
8. Gilchrist, J.: Parallel Data Compression with bzip2. In Proc. the 16th IASTED International Conference on Parallel and Distributed Computing and Systems (2004)
9. Grossi, R., Vitter, J.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing 35 (2005) 378-407
10. Hon, W.-K., Lam, T.-W., Sung, W.-K., Tse, W.-L., Wong, C.-K., Yiu, S.-M.: Practical aspects of compressed suffix arrays and FM-index in searching DNA sequences. In Proc. of the 6th Workshop on Algorithm Engineering and Experiments. SIAM Press (2004) 31-38
11. Mäkinen, V., Navarro, G.: New search algorithms and time/space tradeoffs for succinct suffix arrays. Technical Report C-2004-20. University of Helsinki, Finland (2004)
12. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. In Proc. 16th Annual Symposium on Combinatorial Pattern Matching (2005) 45-56
13. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In Proc. the 1st Annual ACM-SIAM symposium on Discrete Algorithms (1990) 319-327
14. Navarro, G., Mäkinen, V.: Compressed Full-Text Indexes. ACM Computing Surveys 39 (2007) 61
15. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48 (2003) 294-313
16. Stauffer, L.M., Hirschberg, D.S.: Parallel text compression. Technical Report 91-44, Revised. Info, and Comp. Sci. Department, University of California (1993)
17. Wilkinson, B., Allen, M.: Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. Prentice-Hall, Inc. (1998)