GenericBioMatch: A Novel Generic Pattern Match Algorithm for Biological Sequences

AuthorSearch for: ; Search for:
ConferenceProceedings of the IEEE Computer Society Bioinformatics Conference (CSB 2003), ISBN 0-7695-2000-6, Stanford, USA
AbstractGenericBioMatch is a novel algorithm for exact match in biological sequences. It allows the sequence motif pattern to contain one or more wild card letters (eg. Y, R, W in DNA sequences) and one or more gaps of any number of bases. GenericBioMatch is a relatively fast algorithm as compared to probabilistic algorithms, and has very little computational overhead. It is able to perform exact match of protein motifs as well as DNA motifs. This algorithm can serve as a quick validation tool for implementation of other algorithms, and can also serve as a supporting tool for probabilistic algorithms in order to reduce computational overhead. This algorithm has been implemented in the BioMiner software (<a href=""></a>), a suite of java tools for integrated data mining in genomics. It has been tested successfully with DNA sequences from human, yeast, and Arabidopsis.
Publication date
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number45835
NPARC number8913227
Export citationExport as RIS
Report a correctionReport a correction
Record identifier1d51a216-4ba6-469f-b154-22df2b890716
Record created2009-04-22
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)
Date modified: