Sciweavers

545 search results - page 70 / 109
» Multiple Sequence Alignment Using Tabu Search
Sort
View
BMCBI
2006
137views more  BMCBI 2006»
13 years 10 months ago
Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
Alexander F. Auch, Stefan R. Henz, Barbara R. Holl...
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 4 months ago
Pareto optimal search based refactoring at the design level
Refactoring aims to improve the quality of a software systems’ structure, which tends to degrade as the system evolves. While manually determining useful refactorings can be cha...
Mark Harman, Laurence Tratt
FPL
2010
Springer
188views Hardware» more  FPL 2010»
13 years 8 months ago
SeqHive: A Reconfigurable Computer Cluster for Genome Re-sequencing
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
Kristian Stevens, Henry Chen, Terry Filiba, Peter ...
BMCBI
2007
117views more  BMCBI 2007»
13 years 10 months ago
DNA-based watermarks using the DNA-Crypt algorithm
Background: The aim of this paper is to demonstrate the application of watermarks based on DNA sequences to identify the unauthorized use of genetically modified organisms (GMOs) ...
Dominik Heider, Angelika Barnekow
BMVC
2001
14 years 9 days ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock