Sciweavers

178 search results - page 6 / 36
» A Practical Algorithm to Find the Best Episode Patterns
Sort
View
BMCBI
2004
151views more  BMCBI 2004»
13 years 7 months ago
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Jens Reeder, Robert Giegerich
APBC
2008
231views Bioinformatics» more  APBC 2008»
13 years 9 months ago
Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Si...
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 7 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
ISMB
1996
13 years 8 months ago
Discovering Patterns and Subfamilies in Biosequences
Weconsider the problemof automaticdiscoveryof patterns and the corresponding subfamilies in a set of biosequences. Thesequences are unaligned and may contain noise of unknownlevel...
Alvis Brazma, Inge Jonassen, Esko Ukkonen, Jaak Vi...
BMCBI
2007
164views more  BMCBI 2007»
13 years 7 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason