지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2012.1
- 수록면
- 44 - 50 (7page)
이용수
초록· 키워드
오류제보하기
Pattern discovery in biological sequences (e.g., DNA sequences) is one of the most challenging tasks in computational biology and bioinformatics. So far, in most approaches, the number of occurrences is a major measure of determining whether a pattern is interesting or not. In computational biology, however, a pattern that is not frequent may still be considered very informative if its actual support frequency exceeds the prior expectation by a large margin. In this paper, we propose a new interesting measure that can provide meaningful biological information. We also propose an efficient index-based method for mining such interesting patterns. Experimental results show that our approach can find interesting patterns within an acceptable computation time.
목차
등록된 정보가 없습니다.
참고문헌 (14)
참고문헌 신청
Blahut RE / 1987 / Principles and Practice of Information Theory / Addison-Wesley Pub
Agrawal R / 1994 / Fast algorithms for mining association rules / Proceedings of the 20th International Conference on Very Large Data Bases :487~499
Srikant R / 1996 / Mining sequential patterns: generalizations and performance improvements / Proceeding of 5th International Conference on Extending Database Technology :3~17
Pei J / 2001 / PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth / Proceeding of IEEE International Conference on Data Engineering :215~224
Chvátal V / 1995 / Longest common subsequences of two random sequences / J Appl Probab 12:306~315
Agrawal R / 1994 / Fast algorithms for mining association rules / Proceedings of the 20th International Conference on Very Large Data Bases :487~499
Srikant R / 1996 / Mining sequential patterns: generalizations and performance improvements / Proceeding of 5th International Conference on Extending Database Technology :3~17
Pei J / 2001 / PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth / Proceeding of IEEE International Conference on Data Engineering :215~224
Chvátal V / 1995 / Longest common subsequences of two random sequences / J Appl Probab 12:306~315
이 논문의 저자 정보
최근 본 자료
댓글(0)
0