Sciweavers

26 search results - page 1 / 6
» A combinatorial optimization approach for diverse motif find...
Sort
View
ALMOB
2006
138views more  ALMOB 2006»
13 years 4 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
BMCBI
2007
190views more  BMCBI 2007»
13 years 4 months ago
Discriminative motif discovery in DNA and protein sequences using the DEME algorithm
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...
Emma Redhead, Timothy L. Bailey
SDM
2007
SIAM
145views Data Mining» more  SDM 2007»
13 years 6 months ago
Finding Motifs in a Database of Shapes
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...
Xiaopeng Xi, Eamonn J. Keogh, Li Wei, Agenor Mafra...
RECOMB
2008
Springer
14 years 4 months ago
Algorithms for Joint Optimization of Stability and Diversity in Planning Combinatorial Libraries of Chimeric Proteins
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
Wei Zheng, Alan M. Friedman, Chris Bailey-Kellogg
EVOW
2009
Springer
13 years 9 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...