• Publications
  • Influence
An Introduction to Kolmogorov Complexity and Its Applications
  • Ming Li, P. Vitányi
  • Computer Science, Psychology
  • Texts and Monographs in Computer Science
  • 1993
The book is outstanding and admirable in many respects. ... is necessary reading for all kinds of readers from undergraduate students to top authorities in the field. Journal of Symbolic LogicExpand
  • 3,647
  • 241
  • PDF
The similarity metric
We propose a new "normalized information distance," based on the noncomputable notion of Kolmogorov complexity, and show that it is in this class and it minorizes every computable distance in the class. Expand
  • 1,150
  • 133
  • PDF
PatternHunter: faster and more sensitive homology search
We present a new homology search algorithm 'PatternHunter' that uses a novel seed model for increased sensitivity and new hit-processing techniques for significantly increased speed. Expand
  • 883
  • 103
  • PDF
From Gene Trees to Species Trees
This paper studies various algorithmic issues in reconstructing a species tree from gene trees under the duplication and the mutation cost model. Expand
  • 1,477
  • 89
  • PDF
Approximation algorithms for directed Steiner problems
We obtain the first non-trivial approximation algorithms for the Steiner Tree problem and the Generalized Steiner tree problem in general directed graphs. Expand
  • 519
  • 64
  • PDF
Distinguishing string selection problems
This paper presents a collection of string algorithms that are at the core of several biological problems such as discovering potential drug targets, creating diagnostic probes, universal primers or unbiased consensus sequences. Expand
  • 250
  • 32
  • PDF
DNACompress: fast and effective DNA sequence compression
While achieving the best compression ratios for DNA sequences, our new DNACompress program significantly improves the running time of all previous DNA compression programs. Expand
  • 232
  • 28
  • PDF
An information-based sequence distance and its application to whole mitochondrial genome phylogeny
We present a sequence distance that works on unaligned sequences using the information theoretical concept of Kolmogorov complexity and a program to estimate this distance. Expand
  • 541
  • 27
  • PDF
Patternhunter Ii: Highly Sensitive and Fast Homology Search
We extend the single optimized spaced seed of PatternHunter(20) to multiple ones, PatternHunter II approaches Smith-Waterman sensitivity, bringing homology search methodology research back to a full circle. Expand
  • 228
  • 26
  • PDF
A compression algorithm for DNA sequences and its applications in genome comparison
We present a lossless compression algorithm, <italic>Gen-Compress</italic>, for DNA sequences, based on searching for approximate repeats. Expand
  • 253
  • 25
  • PDF