Sciweavers

205 search results - page 38 / 41
» Incomparability of Results Between Phylogenetic Search Progr...
Sort
View
BMCBI
2006
98views more  BMCBI 2006»
14 years 9 months ago
Scanning sequences after Gibbs sampling to find multiple occurrences of functional elements
Background: Many DNA regulatory elements occur as multiple instances within a target promoter. Gibbs sampling programs for finding DNA regulatory elements de novo can be prohibiti...
Kannan Tharakaraman, Leonardo Mariño-Ram&ia...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
14 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
GECCO
2008
Springer
239views Optimization» more  GECCO 2008»
14 years 10 months ago
Multiobjective design of operators that detect points of interest in images
In this paper, a multiobjective (MO) learning approach to image feature extraction is described, where Pareto-optimal interest point (IP) detectors are synthesized using genetic p...
Leonardo Trujillo, Gustavo Olague, Evelyne Lutton,...
BMCBI
2008
99views more  BMCBI 2008»
14 years 9 months ago
Multiple organism algorithm for finding ultraconserved elements
Background: Ultraconserved elements are nucleotide or protein sequences with 100% identity (no mismatches, insertions, or deletions) in the same organism or between two or more or...
Scott Christley, Neil F. Lobo, Gregory R. Madey