Ming Li

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 Logic… Expand

3,647
241
PDF

The similarity metric

Ming Li, X. Chen, Xin Li, Bin Ma, P. Vitányi
Mathematics, Computer Science
IEEE Transactions on Information Theory
20 November 2001

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

Bin Ma, J. Tromp, Ming Li
Computer Science, Medicine
Bioinform.
1 March 2002

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

From Gene Trees to Species Trees

Bin Ma, Ming Li, L. Zhang
Biology, Computer Science
SIAM J. Comput.
1 May 2000

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

M. Charikar, C. Chekuri, +4 authors Ming Li
Mathematics, Computer Science
SODA '98
1 October 1999

We obtain the first non-trivial approximation algorithms for the Steiner Tree problem and the Generalized Steiner tree problem in general directed graphs. Expand

Distinguishing string selection problems

J. K. Lanctôt, Ming Li, Bin Ma, Shaojiu Wang, L. Zhang
Computer Science, Mathematics
SODA '99
25 August 2003

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

DNACompress: fast and effective DNA sequence compression

X. Chen, Ming Li, Bin Ma, J. Tromp
Computer Science, Medicine
Bioinform.
1 December 2002

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

An information-based sequence distance and its application to whole mitochondrial genome phylogeny

Ming Li, J. Badger, X. Chen, S. Kwong, P. Kearney, H. Zhang
Biology, Medicine
Bioinform.
1 February 2001

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

Patternhunter Ii: Highly Sensitive and Fast Homology Search

Ming Li, Bin Ma, D. Kisman, J. Tromp
Mathematics, Medicine
J. Bioinform. Comput. Biol.
1 September 2004

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

A compression algorithm for DNA sequences and its applications in genome comparison

X. Chen, S. Kwong, Ming Li
Mathematics, Computer Science
RECOMB '00
8 April 2000

We present a lossless compression algorithm, <italic>Gen-Compress</italic>, for DNA sequences, based on searching for approximate repeats. Expand

Recommended Authors