![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Demostrations With significant developments of computational biology and bioinformatics, the discovery of interesting patterns in biosequences, including DNA, RNA, and protein sequences, has become an important task in research and applications. An important goal of mining biosequences is to find sequence or repeating patterns hidden in DNA, or other bio-data in large databases. Previous studies have been using various techniques, including statistical analysis, machine learning, minimum description length (MDL) principle, etc. with fruitful results. However, most of these methods can only identify a proper subset of patterns that meet the specifications provided explicitly by users. ![]() DiSC'02 © 2003 Association for Computing Machinery |