Sciweavers

697 search results - page 41 / 140
» Improving EAs for Sequencing Problems
Sort
View
BMCBI
2008
122views more  BMCBI 2008»
13 years 9 months ago
Grammar-based distance in progressive multiple sequence alignment
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...
David J. Russell, Hasan H. Otu, Khalid Sayood
BMCBI
2006
99views more  BMCBI 2006»
13 years 9 months ago
MAGIC-SPP: a database-driven DNA sequence processing package with associated management tools
Background: Processing raw DNA sequence data is an especially challenging task for relatively small laboratories and core facilities that produce as many as 5000 or more DNA seque...
Chun Liang, Feng Sun, Haiming Wang, Junfeng Qu, Ro...
UAI
2003
13 years 10 months ago
The Revisiting Problem in Mobile Robot Map Building: A Hierarchical Bayesian Approach
We present an application of hierarchical Bayesian estimation to robot map building. The revisiting problem occurs when a robot has to decide whether it is seeing a previously-bui...
Benjamin Stewart, Jonathan Ko, Dieter Fox, Kurt Ko...
BMCBI
2006
166views more  BMCBI 2006»
13 years 9 months ago
SEQOPTICS: a protein sequence clustering system
Background: Protein sequence clustering has been widely used as a part of the analysis of protein structure and function. In most cases single linkage or graph-based clustering al...
Yonghui Chen, Kevin D. Reilly, Alan P. Sprague, Zh...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 11 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos