Full metadata record
DC FieldValueLanguage
dc.contributor.authorTsai, THen_US
dc.contributor.authorLee, SYen_US
dc.date.accessioned2014-12-08T15:26:14Z-
dc.date.available2014-12-08T15:26:14Z-
dc.date.issued2003en_US
dc.identifier.isbn0-7695-2031-6en_US
dc.identifier.urihttp://hdl.handle.net/11536/18620-
dc.description.abstractIn 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.isoen_USen_US
dc.titleSimSearcher: A local similarity search engine for biological sequence databasesen_US
dc.typeProceedings Paperen_US
dc.identifier.journalIEEE FIFTH INTERNATIOANL SYMPOSIUM ON MULTIMEDIA SOFTWARE ENGINEERING, PROCEEDINGSen_US
dc.citation.spage305en_US
dc.citation.epage312en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000188865700041-
Appears in Collections:Conferences Paper