Sciweavers

434 search results - page 63 / 87
» Constraint-Based Combinators for Local Search
Sort
View
BIBE
2006
IEEE
119views Bioinformatics» more  BIBE 2006»
14 years 4 months ago
Large Grain Size Stochastic Optimization Alignment
DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima pro...
Perry Ridge, Hyrum Carroll, Dan Sneddon, Mark J. C...
AI
2000
Springer
13 years 10 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
BMCBI
2006
145views more  BMCBI 2006»
13 years 10 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
14 years 10 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
DEXAW
2008
IEEE
120views Database» more  DEXAW 2008»
14 years 4 months ago
Self-Similarity Metric for Index Pruning in Conceptual Vector Space Models
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
Dario Bonino, Fulvio Corno