(1) Department of Biology, University of Padova, Via Bassi 58/B, 35131 Padova, Italy;(2) Department of Information Engineering, University of Padova, Via Gradenigo 6/B, 35131 Padova, Italy
Abstract:
Background
Searching for approximate patterns in large promoter sequences frequently produces an exceedingly high numbers of results. Our aim was to exploit biological knowledge for definition of a sheltered search space and of appropriate search parameters, in order to develop a method for identification of a tractable number of sequence motifs.
