Voting is a software package that discovers common patterns, motif, in a set of DNA sequences. Voting is efficient to solve the planted (l,d) motif problem which discover a hidden length-l string motif appear in each input DNA sequence with at most d Hamming distance. Our package guarantees discovering all motifs in a short time.
Bioinformatics Research Group of Hong Kong University
:: MORE INFORMATION
Francis Y.L. Chin and Henry C.M. Leung.
Voting Algorithms for Discovering Long Motifs (2005)
In Proceedings of Asia-Pacific Bioinformatics Conference (APBC) pages 261 – 271