By Topic

GenericBioMatch: A novel generic pattern match algorithm for biological sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Youlian Pan ; Inst. for Inf. Technol., Nat. Res. Council of Canada, Ottawa, Ont., Canada ; Famili, A.F.

GenericBioMatch 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 (http://iit-iti.nrc-cnrc.gc.ca/biomine e.trx), a suite of Java tools for integrated data mining in genomics. It has been tested successfully with DNA sequences from human, yeast, and Arabidopsis.

Published in:

Bioinformatics Conference, 2003. CSB 2003. Proceedings of the 2003 IEEE

Date of Conference:

11-14 Aug. 2003