Sciweavers

92 search results - page 7 / 19
» Constrained Molecular Dynamics as a Search and Optimization ...
Sort
View
BMCBI
2004
150views more  BMCBI 2004»
13 years 7 months ago
SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters
Background: Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a u...
Chunlin Wang, Elliot J. Lefkowitz
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 29 days ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
14 years 1 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
13 years 8 months ago
Handling dynamic data structures in search based testing
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
Kiran Lakhotia, Mark Harman, Phil McMinn
WSC
2008
13 years 9 months ago
Automating the constraining process
The typical approach to finding minimum levels of resources that still allow support and operational performance goals to be met for military aircraft is based on a manual trial-a...
Joel J. Luna