Compressed pattern matching in DNA sequences using multithreaded technology

3rd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2009

Volumn , Issue , 2009, Pages

  Piyuan, Lin ^a   Shaopeng, Liu ^a   Lixia, Zhang ^a   Peijie, Huang ^a  

^a SOUTH CHINA AGRICULTURAL UNIVERSITY   (China)

Author keywords

Compressed pattern matching; D BM; Multithreaded programming technology

Indexed keywords

BOYER-MOORE METHOD; COMPRESSED PATTERN MATCHING; DNA PATTERNS; MULTI-THREADED ALGORITHMS; MULTITHREADED PROGRAMMING; MULTITHREADED TECHNOLOGY; SPACE SAVINGS;

ALGORITHMS; BIOINFORMATICS; DNA; GENES; NUCLEIC ACIDS; PARALLEL PROGRAMMING; PATTERN MATCHING;

DNA SEQUENCES;

EID: 72749122518     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICBBE.2009.5162550     Document Type: Conference Paper

References (15)

1. Don Adjeroh, Yong Zhang, Amar Mukherjee, Matt Powell, Tim Bell, "DNA Sequence Compression Using the Burrows-Wheeler Transform, " csb,pp.303, IEEE Computer Society Bioinformatics Conference (CSB'02), 2002
2. Chen X., Kwong S.and Li M, "A compression algorithm for DNA sequences and its applications in genome comparison", In Proceedings, 10th Workshop on Genome Informatics (GIW'99), pp. 52-61, 1999.
3. Grumbach S and Tahi F., "A new challenge for compression algorithms: genetic sequences", Info. Processing & Management, 30: 875-886, 1994.
4. Burrows M. and Wheeler D.J., "A block-sorting lossless data compression algorithm", Technical Report, Digital Equipment Corporation, Palo Alto, CA, 1994.
5. Tao Tao, Amar Mukherjee, "Pattern Matching in LZW Compressed Files," IEEE Transactions on Computers, vol. 54, no. 8, pp. 929-938, Aug., 2005.
6. T. Bell, M. Powell, A. Mukherjee, and D. Adjeroh, "Searching BWT Compressed Text with the Boyer-Moore Algorithm and Binary Search", Proc. Data Compression Conf., pp. 112-121, Apr. 2002.
7. CHEN Lei, LU Shiyong, RAM J.Compressed Pattern Matching in DNA Sequences: IEEE Computational Systems Bioinformatics Conference, 2004[C]. Washington,DC: IEEE Computer Society,2004: 62-68.
8. BOYER R S,MOORE J S.A Fast String Searching Algorithm[J]. Communications of the ACM, 1977,20(10):762-772.
9. Lu Yang , Jianwen Tang , Jianhua Zhao , Xuandong Li, "A case study for monitoring-oriented programming in multi-core architecture", Proceedings of the 1st international workshop on Multicore software engineering, May 11-11, 2008, Leipzig, Germany.
10. K. A. Berman and J. L. Paul. Algorithms:Sequential, Parallel, and Distributed. Course Technology, 2005
11. K. Wackowski and P. Gepner. Hyper-threading technology speeds clusters. In Parallel Processing and Applied Mathematics, 5th Int'l Conf., pages 17-26, 2003.
12. T. Martinez. Understanding dual processors, hyperthreading technology, and multicore systems, 2005. http://www.devx.com/goparallel/article/27399.
13. Karen L. Sielski, "Implementing Ada tasking in a multiprocessing, multithreaded UNIX environment", NewYork: ACM Special Interest Group on Ada Programming Language, 1992: 512-517.
14. Lok-Lam Cheng , David W. Cheung , Siu-Ming Yiu, "Approximate String Matching in DNA Sequences", Proceedings of the Eighth International Conference on Database Systems for Advanced Applications, p.303, March 26-28, 2003.
15. T. Kida, M. Takeda, M. Miyazaki, A. Shinohara, and S. Arikawa, "Multiple Pattern Matching in LZW Compressed Text", J. Discrete Algorithm, vol. 1, no. 1, 2000.