Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tsai, TH | en_US |
dc.contributor.author | Lee, SY | en_US |
dc.date.accessioned | 2014-12-08T15:26:14Z | - |
dc.date.available | 2014-12-08T15:26:14Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.isbn | 0-7695-2031-6 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/18620 | - |
dc.description.abstract | In this paper an efficient local similarity search engine is developed exploiting some techniques of data mining. First of all, all frequent patterns in the database are retrieved and recorded in a one-time preprocessing process. Then a query sequence is checked for whether any pattern from the preprocessing stage is matched to the query. Two regions coming from the query and a database sequence that both match to a pattern form a possible seed for the local similarity. Finally, we extend and score each such seed region pair to see whether there really exists a local similarity with a score high enough for reporting. For computational efficiency, a novel clustering approach is proposed and is integrated into the proposed system, which is based on the local similarity search engine - DELPHI system proposed by IBM. Extensive experiments are demonstrated to show the performance of our system. | en_US |
dc.language.iso | en_US | en_US |
dc.title | SimSearcher: A local similarity search engine for biological sequence databases | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | IEEE FIFTH INTERNATIOANL SYMPOSIUM ON MULTIMEDIA SOFTWARE ENGINEERING, PROCEEDINGS | en_US |
dc.citation.spage | 305 | en_US |
dc.citation.epage | 312 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000188865700041 | - |
Appears in Collections: | Conferences Paper |