Sciweavers

434 search results - page 9 / 87
» Information measures for infinite sequences
Sort
View
APAL
2010
85views more  APAL 2010»
13 years 8 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
ALMOB
2008
131views more  ALMOB 2008»
13 years 8 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
BMCBI
2008
132views more  BMCBI 2008»
13 years 8 months ago
The Average Mutual Information Profile as a Genomic Signature
Background: Occult organizational structures in DNA sequences may hold the key to understanding functional and evolutionary aspects of the DNA molecule. Such structures can also p...
Mark Bauer, Sheldon M. Schuster, Khalid Sayood
TGIS
2002
103views more  TGIS 2002»
13 years 8 months ago
The Nature of Uncertainty in Historical Geographic Information
While the presence of uncertainty in the geometric and attribute aspects of geographic information is well known, it is also present in temporal information. In spatiotemporal GIS...
Brandon Plewe
RECOMB
2008
Springer
14 years 9 months ago
Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...
Miklós Csürös