지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2012.1
- 수록면
- 51 - 57 (7page)
이용수
초록· 키워드
오류제보하기
Mining interesting patterns from DNA sequences is one of the most challenging tasks in bioinformatics and computational biology. Maximal contiguous frequent patterns are preferable for expressing the function and structure of DNA sequences and hence can capture the common data characteristics among related sequences. Biologists are interested in finding frequent orderly arrangements of motifs that are responsible for similar expression of a group of genes. In order to reduce mining time and complexity, however, most existing sequence mining algorithms either focus on finding short DNA sequences or require explicit specification of sequence lengths in advance. The challenge is to find longer sequences without specifying sequence lengths in advance. In this paper, we propose an efficient approach to mining maximal contiguous frequent patterns from large DNA sequence datasets. The experimental results show that our proposed approach is memory-efficient and mines maximal contiguous frequent patterns within a reasonable time.
목차
등록된 정보가 없습니다.
참고문헌 (14)
참고문헌 신청
Chváatal V / 1975 / Longest common subsequences of two random sequences / J Appl Probab 12:306~315
Hirschberg DS / 1977 / Algorithms for the longest common subsequence problem / J Assoc Comput Mach 24:664~675
Huo H / 2007 / A suffix tree construction algorithm for DNA sequences / Proceeding of IEEE International Conference on Bioinformatics and Bioengineering :1178~1172
Tata S / 2004 / Practical suffix tree construction / Proceeding of 30th International Conference on Very Large Data Bases :36~47
Agrawal R / 1994 / Fast algorithms for mining association rules / Proceeding of 20th International Conference on Very Large Data Bases :487~499
Hirschberg DS / 1977 / Algorithms for the longest common subsequence problem / J Assoc Comput Mach 24:664~675
Huo H / 2007 / A suffix tree construction algorithm for DNA sequences / Proceeding of IEEE International Conference on Bioinformatics and Bioengineering :1178~1172
Tata S / 2004 / Practical suffix tree construction / Proceeding of 30th International Conference on Very Large Data Bases :36~47
Agrawal R / 1994 / Fast algorithms for mining association rules / Proceeding of 20th International Conference on Very Large Data Bases :487~499
이 논문의 저자 정보
최근 본 자료
댓글(0)
0