For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
Zheng Zhang 0004, Scott Schwartz, Lukas Wagner, We...
This article presents a model for DNA sequence alignment. In our model, a finite state automaton writes two-dimensional maps of nucleotide sequences. An evolutionary method for se...
Background: Expression microarrays are increasingly used to characterize environmental responses and hostparasite interactions for many different organisms. Probe selection for cD...
Yian A. Chen, David J. Mckillen, Shuyuan Wu, Matth...
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...