Sciweavers

3758 search results - page 169 / 752
» A Complete Subsumption Algorithm
Sort
View
RECOMB
1997
Springer
15 years 2 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
ATAL
2008
Springer
15 years 3 days ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
BMCBI
2010
135views more  BMCBI 2010»
14 years 10 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
BMCBI
2006
99views more  BMCBI 2006»
14 years 10 months ago
Genetic algorithm learning as a robust approach to RNA editing site prediction
Background: RNA editing is one of several post-transcriptional modifications that may contribute to organismal complexity in the face of limited gene complement in a genome. One f...
James Thompson, Shuba Gopal
BMCBI
2007
148views more  BMCBI 2007»
14 years 10 months ago
WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
Background: This work addresses the problem of detecting conserved transcription factor binding sites and in general regulatory regions through the analysis of sequences from homo...
Giulio Pavesi, Federico Zambelli, Graziano Pesole