Sciweavers

7 search results - page 1 / 2
» Divide-and-Conquer Frontier Search Applied to Optimal Sequen...
Sort
View
AAAI
2000
13 years 6 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
IJCAI
2003
13 years 6 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf
BMCBI
2008
106views more  BMCBI 2008»
13 years 5 months ago
Searching for evolutionary distant RNA homologs within genomic sequences using partition function posterior probabilities
Background: Identification of RNA homologs within genomic stretches is difficult when pairwise sequence identity is low or unalignable flanking residues are present. In both cases...
Usman Roshan, Satish Chikkagoudar, Dennis R. Lives...
ICIC
2009
Springer
13 years 11 months ago
A Method for Multiple Sequence Alignment Based on Particle Swarm Optimization
Sequence Alignment is a basic information disposal method in Bioinformatics. However, it is difficult to deal with multiple sequence alignment problem(MSA). In this paper, an impro...
Fasheng Xu, Yuehui Chen
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
13 years 8 months ago
Pairwise sequence comparison for fitness evaluation in evolutionary structural software testing
Evolutionary algorithms are among the metaheuristic search methods that have been applied to the structural test data generation problem. Fitness evaluation methods play an import...
H. Turgut Uyar, A. Sima Etaner-Uyar, A. Emre Harma...