Sciweavers

1000 search results - page 187 / 200
» Dependency Tree Automata
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
13 years 10 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
AI
2006
Springer
13 years 10 months ago
Is real-valued minimax pathological?
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...
Mitja Lustrek, Matjaz Gams, Ivan Bratko
CORR
2007
Springer
122views Education» more  CORR 2007»
13 years 10 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
BMCBI
2005
93views more  BMCBI 2005»
13 years 10 months ago
Multiple sequence alignment accuracy and evolutionary distance estimation
Background: Sequence alignment is a common tool in bioinformatics and comparative genomics. It is generally assumed that multiple sequence alignment yields better results than pai...
Michael S. Rosenberg
AI
2011
Springer
13 years 5 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...