한국생물정보학회:학술대회논문집 (Proceedings of the Korean Society for Bioinformatics Conference)
- 한국생물정보시스템생물학회 2003년도 제2차 연례학술대회 발표논문집
- /
- Pages.193-199
- /
- 2003
Finding approximate occurrence of a pattern that contains gaps by the bit-vector approach
- Lee, In-Bok (School of Computer Science and Engineering, Seoul National University) ;
-
Park, Kun-Soo
(School of Computer Science and Engineering, Seoul National University)
- 발행 : 2003.10.31
초록
The application of finding occurrences of a pattern that contains gaps includes information retrieval, data mining, and computational biology. As the biological sequences may contain errors, it is important to find not only the exact occurrences of a pattern but also approximate ones. In this paper we present an O(mnk
키워드