Ming Li Paul Vitányi Fourth Edition Page 1 An Introduction to Kolmogorov Complexity and Its
Applications Ming Li Paul Vitányi Fourth Edition Texts in Computer Science Page 2 Texts in …

A new class of distances appropriate for measuring similarity relations between sequences,
say one type of similarity per distance, is studied. We propose a new" normalized …

Motivation: Textual data compression, and the associated techniques coming from
information theory, are often perceived as being of interest for data communication and …

Motivation: To compare entire genomes from different species, biologists increasingly need
alignment methods that are efficient enough to handle long sequences, and accurate …

Motivation: Traditional sequence distances require an alignment and therefore are not
directly applicable to the problem of whole genome phylogeny where events such as …

Motivation: Most existing approaches for phylogenetic inference use multiple alignment of
sequences and assume some sort of an evolutionary model. The multiple alignment strategy …

We present a lossless compression algorithm, Gen-Compress, for DNA sequences, based
on searching for approximate repeats. Our algorithm achieves the best compression ratios …

The enormous complexity of biological systems at the molecular level must be answered
with powerful computational methods. Computational biology is a young field, but has seen …

Motivation: The theory and practice of genome rearrangement analysis breaks down in the
biologically widespread contexts where each gene may be present in a number of copies …

Motivation: Reconstructing and analyzing the metabolic map of microorganisms is an
important challenge in bioinformatics. Pathway analysis of large metabolic networks meets …