Lower Bounds by Kolmogorov-Complexity (Extended Abstract). - Ming Li 001 (ICALP, 1985)

Lower Bounds in Computational Complexity. - Ming Li 001 (1985)

k+1 Heads Are Better than k for PDA's - Marek Chrobak; Ming Li 001 (FOCS, 1986)

Containment, Separation, Complete Sets, and Immunity of Complexity Classes. - Juris Hartmanis; Ming Li 001; Yaacov Yesha (ICALP, 1986)

String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation. - Ming Li 001; Yaacov Yesha (Inf. Process. Lett., 1986)

Bounded Time-Stamps (Extended Abstract) - Amos Israeli; Ming Li 001 (FOCS, 1987)

The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions. - Ming Li 001; Yaacov Yesha (ICALP, 1987)

On Processor Coordination Using Asynchronous Hardware. - Benny Chor; Amos Israeli; Ming Li 001 (PODC, 1987)

On the Learnability of Boolean Formulae - Michael J. Kearns; Ming Li 001; Leonard Pitt; Leslie G. Valiant (STOC, 1987)

Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation - Ming Li 001; Yaacov Yesha (Inf. Comput., 1987)

Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87. - Ming Li 001; Paul M. B. Vitányi (SCT, 1988)

On the Learnability of Finite Automata. - Ming Li 001; Umesh V. Vazirani (COLT, 1988)

Learning in the Presence of Malicious Errors (Extended Abstract) - Michael J. Kearns; Ming Li 001 (STOC, 1988)

A Separator Theorem for One-Dimensional Graphs Under Linear Mapping. - Ming Li 001 (Inf. Process. Lett., 1988)

k+1 Heads Are Better than k for PDAs. - Marek Chrobak; Ming Li 001 (J. Comput. Syst. Sci., 1988)

Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time. - Ming Li 001 (J. Comput. Syst. Sci., 1988)

Tape versus Queue and Stacks: The Lower Bounds - Ming Li 001; Paul M. B. Vitányi (Inf. Comput., 1988)

Inductive Reasoning and Komogorov Complexity. - Ming Li 001; Paul M. B. Vitányi (SCT, 1989)

A Theory of Learning Simple Concepts Under Simple Distributions and Average Case Complexity for the Universal Distribution (Extended Abstract) - Ming Li 001; Paul M. B. Vitányi (FOCS, 1989)

How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version). - Ming Li 001; Paul M. B. Vitányi (ICALP, 1989)

A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version). - Ming Li 001; Paul M. B. Vitányi (ICALP, 1989)

The Minimum Description Length Principle and Its Application to Online Learning of Handprinted Characters. - Qiong Gao; Ming Li 001 (IJCAI, 1989)

Geometric Optimization and Dp - Completeness. - Chandrajit L. Bajaj; Ming Li 001 (Discret. Comput. Geom., 1989)

New lower bounds for parallel computation. - Ming Li 001; Yaacov Yesha (J. ACM, 1989)

On the Power of Concurrent-Write PRAMs With Read-Only Memory - Faith E. Fich; Ming Li 001; Prabhakar Ragde; Yaacov Yesha (Inf. Comput., 1989)

Kolmogorov Complexity and its Applications. - Ming Li 001; Paul M. B. Vitányi (Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990)

Towards a DNA Sequencing Theory (Learning a String) (Preliminary Version) - Ming Li 001 (FOCS, 1990)

An introduction to Kolmogorov - complexity and its applications ; part 1: theory. - Ming Li 001; Paul M. B. Vitányi (CWI, 1991)

A Quantitative Theory for Plan Merging. - David E. Foulser; Ming Li 001; Qiang Yang 001 (AAAI, 1991)

Combinatorics and Kolmogorov Complexity. - Ming Li 001; Paul M. B. Vitányi (SCT, 1991)

Resource Bounds for Parallel Computation of Threshold and Symmetric Functions. - Ming Li 001; Yaacov Yesha (J. Comput. Syst. Sci., 1991)

Learning Simple Concept Under Simple Distributions. - Ming Li 001; Paul M. B. Vitányi (SIAM J. Comput., 1991)

Inductive reasoning. - Ming Li 001; Paul M. B. Vitányi (Language Computations, 1992)

Philosophical Issues in Kolmogorov Complexity. - Ming Li 001; Paul M. B. Vitányi (ICALP, 1992)

Theory and Algorithms for Plan Merging. - David E. Foulser; Ming Li 001; Qiang Yang 001 (Artif. Intell., 1992)

A Note on Shortest Superstrings with Flipping. - Tao Jiang 001; Ming Li 001; Ding-Zhu Du (Inf. Process. Lett., 1992)

Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity. - Ming Li 001; Paul M. B. Vitányi (Inf. Process. Lett., 1992)

Optimality of Wait-Free Atomic Multiwriter Variables. - Ming Li 001; Paul M. B. Vitányi (Inf. Process. Lett., 1992)

Inductive Reasoning and Kolmogorov Complexity. - Ming Li 001; Paul M. B. Vitányi (J. Comput. Syst. Sci., 1992)

The Power of the Queue. - Ming Li 001; Luc Longpré; Paul M. B. Vitányi (SIAM J. Comput., 1992)

An introduction to Kolmogorov complexity and its applications. - Ming Li 001; Paul M. B. Vitányi (Springer, 1993)

Thermodynamics of computation and information distance. - Charles H. Bennett; Péter Gács; Ming Li 001; Paul M. B. Vitányi; Wojciech H. Zurek (STOC, 1993)

Approximating Shortest Superstrings with Constraints (Extended Abstract). - Tao Jiang 001; Ming Li 001 (WADS, 1993)

Bonded Time-Stamps. - Amos Israeli; Ming Li 001 (Distributed Comput., 1993)

Learning in the Presence of Malicious Errors. - Michael J. Kearns; Ming Li 001 (SIAM J. Comput., 1993)

On the Complexity of Learning Strings and Sequences. - Tao Jiang 001; Ming Li 001 (Theor. Comput. Sci., 1993)

Linear Approximation of Shortest Superstrings. - Avrim Blum; Tao Jiang 001; Ming Li 001; John Tromp; Mihalis Yannakakis (J. ACM, 1994)

Learning Boolean Formulas. - Michael J. Kearns; Ming Li 001; Leslie G. Valiant (J. ACM, 1994)

Three One-Way Heads Cannot Do String Matching. - Mihály Geréb-Graus; Ming Li 001 (J. Comput. Syst. Sci., 1994)

Kolmogorov Complexity Arguments in Combinatorics. - Ming Li 001; Paul M. B. Vitányi (J. Comb. Theory A, 1994)

Statistical Properties of Finite Sequences with High Kolmogorov Complexity. - Ming Li 001; Paul M. B. Vitányi (Math. Syst. Theory, 1994)

Wait-Free Consensus Using Asynchronous Hardware. - Benny Chor; Amos Israeli; Ming Li 001 (SIAM J. Comput., 1994)

Approximating Shortest Superstrings with Constraints. - Tao Jiang 001; Ming Li 001 (Theor. Comput. Sci., 1994)

Computational Machine Learning in Theory and Praxis. - Ming Li 001; Paul M. B. Vitányi (Computer Science Today, 1995)

Inferring a DNA Sequence from Erroneous Copies (Abstract). - John D. Kececioglu; Ming Li 001; John Tromp (ALT, 1995)

Lower Bounds on Learning Decision Lists and Trees (Extended Abstract). - Thomas R. Hancock; Tao Jiang 001; Ming Li 001; John Tromp (STACS, 1995)

Algorithmic Arguments in Physics of Computation. - Paul M. B. Vitányi; Ming Li 001 (WADS, 1995)

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. - Tao Jiang 001; Ming Li 001 (SIAM J. Comput., 1995)

A New Approach to Formal Language Theory by Kolmogorov Complexity. - Ming Li 001; Paul M. B. Vitányi (SIAM J. Comput., 1995)

Reversible Simulation of Irreversible Computation. - Ming Li 001; Paul M. B. Vitányi (CCC, 1996)

Some Notes on the Nearest Neighbour Interchange Distance. - Ming Li 001; John Tromp; Louxin Zhang (COCOON, 1996)

Lower Bounds on Learning Decision Lists and Trees. - Thomas R. Hancock; Tao Jiang 001; Ming Li 001; John Tromp (Inf. Comput., 1996)

How to Share Concurrent Wait-Free Variables. - Ming Li 001; John Tromp; Paul M. B. Vitányi (J. ACM, 1996)

K One-Way Heads Cannot Do String-Matching. - Tao Jiang 001; Ming Li 001 (J. Comput. Syst. Sci., 1996)

DNA Sequencing and String Learning. - Tao Jiang 001; Ming Li 001 (Math. Syst. Theory, 1996)

Iterative Belief Revision in Extended Logic Programming. - Jia-Huai You; Robert Cartwright; Ming Li 001 (Theor. Comput. Sci., 1996)

Formal Models and Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar (The Computer Science and Engineering Handbook, 1997)

An introduction to Kolmogorov complexity and its applications, Second Edition. - Ming Li 001; Paul M. B. Vitányi (Springer, 1997)

Shortest common superstrings. - Ming Li 001; Tao Jiang 001 (Pattern Matching Algorithms, 1997)

Average-Case Analysis Using Kolmogorov Complexity. - Ming Li 001; Paul M. B. Vitányi (Advances in Algorithms, Languages, and Complexity, 1997)

On Prediction by Data Compression. - Paul M. B. Vitányi; Ming Li 001 (ECML, 1997)

Average-Case Analysis via Incompressibility. - Ming Li 001; Paul M. B. Vitányi (FCT, 1997)

Kolmogorov random graphs. - Harry Buhrman; Ming Li 001; Paul M. B. Vitányi (SEQUENCES, 1997)

On Distances between Phylogenetic Trees (Extended Abstract). - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp; Louxin Zhang (SODA, 1997)

Reversible Simulation of Irreversible Computation by Pebble Games - Ming Li 001; John Tromp; Paul M. B. Vitányi (CoRR, 1997)

Reversibility and Adiabatic Computation: Trading Time and Space for Energy - Ming Li 001; Paul M. B. Vitányi (CoRR, 1997)

Foreword (COCOON'95). - Ding-Zhu Du; Ming Li 001 (Theor. Comput. Sci., 1997)

Inferring a DNA Sequence from Erroneous Copies. - John D. Kececioglu; Ming Li 001; John Tromp (Theor. Comput. Sci., 1997)

Average-Case Analysis Using Kolgomorov Complexity (Abstract). - Ming Li 001; Paul M. B. Vitányi (CATS, 1998)

Better Approximation of Diagonal-Flip Transformation and Rotation Transformation. - Ming Li 001; Louxin Zhang (COCOON, 1998)

Orchestrating Quartets: Approximation and Data Correction. - Tao Jiang 001; Paul E. Kearney; Ming Li 001 (FOCS, 1998)

On reconstructing species trees from gene trees in term of duplications and losses. - Bin Ma 002; Ming Li 001; Louxin Zhang (RECOMB, 1998)

New Applications of the Incompressibility Method: Part I - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (CoRR, 1998)

On the Complexity and Approximation of Syntenic Distance. - Bhaskar DasGupta; Tao Jiang 001; Sampath Kannan; Ming Li 001; Elizabeth Sweedyk (Discret. Appl. Math., 1998)

Addition in log2n + O(1) Steps on Average: A Simple Analysis. - Richard Beigel; William I. Gasarch; Ming Li 001; Louxin Zhang (Theor. Comput. Sci., 1998)

Information Distance. - Charles H. Bennett; Péter Gács; Ming Li 001; Paul M. B. Vitányi; Wojciech H. Zurek (IEEE Trans. Inf. Theory, 1998)

Basic Notions in Computational Complexity. - Tao Jiang 001; Ming Li 001; Bala Ravikumar (Algorithms and Theory of Computation Handbook, 1999)

Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

Formal Grammars and Languages. - Tao Jiang 001; Ming Li 001; Bala Ravikumar; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

Some Examples of Average-case Analysis by the Imcompressibility Method. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (Jewels are Forever, 1999)

The Expected Size of Heilbronn's Triangles. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (CCC, 1999)

On computing the nearest neighbor interchange distance. - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp; Louxin Zhang (Discrete Mathematical Problems with Medical Applications, 1999)

Quartet Cleaning: Improved Algorithms and Simulations. - Vincent Berry; Tao Jiang 001; Paul E. Kearney; Ming Li 001; Todd Wareham (ESA, 1999)

New Applications of the Incompressibility Method. - Harry Buhrman; Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (ICALP, 1999)

Average-Case Complexity of Shellsort. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (ICALP, 1999)

Recovering Branches on the Tree of Life: An Approximation Algorithm. - Paul E. Kearney; Ming Li 001; John Tsang; Tao Jiang 001 (SODA, 1999)

Finding Similar Regions in Many Strings. - Ming Li 001; Bin Ma 002; Lusheng Wang 001 (STOC, 1999)

On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp (Algorithmica, 1999)

New Applications of the Incompressibility Method. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (Comput. J., 1999)

Average-Case Complexity of Shellsort (Preliminary version) - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (CoRR, 1999)

Approximation Algorithms for Directed Steiner Problems. - Moses Charikar; Chandra Chekuri; To-Yat Cheung; Zuo Dai; Ashish Goel; Sudipto Guha; Ming Li 001 (J. Algorithms, 1999)

Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions. - Ming Li 001; Louxin Zhang (J. Algorithms, 1999)

Kolmogorov Random Graphs and the Incompressibility Method. - Harry Buhrman; Ming Li 001; John Tromp; Paul M. B. Vitányi (SIAM J. Comput., 1999)

Some open problems in computational molecular biology. - Tao Jiang 001; Paul E. Kearney; Ming Li 001 (SIGACT News, 1999)

A compression algorithm for DNA sequences and its applications in genome comparison. - Xin Chen; Sam Kwong; Ming Li 001 (RECOMB, 2000)

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). - Vincent Berry; David Bryant; Tao Jiang 001; Paul E. Kearney; Ming Li 001; Todd Wareham; Haoyong Zhang (SODA, 2000)

Computing the quartet distance between evolutionary trees. - David Bryant; John Tsang; Paul E. Kearney; Ming Li 001 (SODA, 2000)

Estimating DNA sequence entropy. - J. Kevin Lanctôt; Ming Li 001; En-Hui Yang (SODA, 2000)

The Incompressibility Method. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (SOFSEM, 2000)

Applying MDL to learn best model granularity. - Qiong Gao; Ming Li 001; Paul M. B. Vitányi (Artif. Intell., 2000)

Applying MDL to Learning Best Model Granularity - Qiong Gao; Ming Li 001; Paul M. B. Vitányi (CoRR, 2000)

Fixed topology alignment with recombination. - Lusheng Wang 001; Bin Ma 002; Ming Li 001 (Discret. Appl. Math., 2000)

A lower bound on the average-case complexity of shellsort. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (J. ACM, 2000)

Average-Case Analysis of Algorithms Using Kolmogorov Complexity. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (J. Comput. Sci. Technol., 2000)

A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application. - Tao Jiang 001; Paul E. Kearney; Ming Li 001 (SIAM J. Comput., 2000)

From Gene Trees to Species Trees. - Bin Ma 002; Ming Li 001; Louxin Zhang (SIAM J. Comput., 2000)

New applications of the incompressibility method: Part II. - Harry Buhrman; Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (Theor. Comput. Sci., 2000)

Minimum description length induction, Bayesianism, and Kolmogorov complexity. - Paul M. B. Vitányi; Ming Li 001 (IEEE Trans. Inf. Theory, 2000)

An information-based sequence distance and its application to whole mitochondrial genome phylogeny. - Ming Li 001; Jonathan H. Badger; Xin Chen; Sam Kwong; Paul E. Kearney; Haoyong Zhang (Bioinform., 2001)

Selected papers from ALT 1997 - Foreword. - Ming Li 001 (Theor. Comput. Sci., 2001)

DNACompress: fast and effective DNA sequence compression. - Xin Chen; Ming Li 001; Bin Ma 002; John Tromp (Bioinform., 2002)

PatternHunter: faster and more sensitive homology search. - Bin Ma 002; John Tromp; Ming Li 001 (Bioinform., 2002)

On the closest string and substring problems. - Ming Li 001; Bin Ma 002; Lusheng Wang 001 (J. ACM, 2002)

Finding Similar Regions in Many Sequences. - Ming Li 001; Bin Ma 002; Lusheng Wang 001 (J. Comput. Syst. Sci., 2002)

The average-case area of Heilbronn-type triangles. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (Random Struct. Algorithms, 2002)

Protein Threading by Linear Programming. - Jinbo Xu; Ming Li 001; Guo-Hui Lin; Dongsup Kim; Ying Xu 001 (Pacific Symposium on Biocomputing, 2003)

MOLVIE: an interactive visualization environment for molecular structures. - Huandong Sun; Ming Li 001; Ying Xu 001 (Comput. Methods Programs Biomed., 2003)

Distinguishing string selection problems. - J. Kevin Lanctôt; Ming Li 001; Bin Ma 002; Shaojiu Wang; Louxin Zhang (Inf. Comput., 2003)

Sharpening Occam's razor. - Ming Li 001; John Tromp; Paul M. B. Vitányi (Inf. Process. Lett., 2003)

Raptor: Optimal Protein Threading by Linear Programming. - Jinbo Xu; Ming Li 001; Dongsup Kim; Ying Xu 001 (J. Bioinform. Comput. Biol., 2003)

PathwayFinder: Paving the Way Towards Automatic Pathway Extraction. - Daming Yao; Jingbo Wang; Yanmei Lu; Nathan Noble; Huandong Sun; Xiaoyan Zhu 001; Nan Lin; Donald G. Payan; Ming Li 001; Kunbin Qu (APBC, 2004)

Discovering Patterns to Extract Protein-Protein Interactions from Full Biomedical Texts. - Minlie Huang; Xiaoyan Zhu 001; Donald G. Payan; Kunbin Qu; Ming Li 001 (NLPBA/BioNLP, 2004)

Discovering patterns to extract protein-protein interactions from full texts. - Minlie Huang; Xiaoyan Zhu 001; Hao Yu 005; Donald G. Payan; Kunbin Qu; Ming Li 001 (Bioinform., 2004)

On spaced seeds for similarity search. - Uri Keich; Ming Li 001; Bin Ma 002; John Tromp (Discret. Appl. Math., 2004)

Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme. - Jonathan H. Badger; Paul E. Kearney; Ming Li 001; John Tsang; Tao Jiang 001 (J. Algorithms, 2004)

A Tutorial of Recent Developments in the Seeding of Local Alignment. - Daniel G. Brown 001; Ming Li 001; Bin Ma 002 (J. Bioinform. Comput. Biol., 2004)

Patternhunter Ii: Highly Sensitive and Fast Homology Search. - Ming Li 001; Bin Ma 002; Derek Kisman; John Tromp (J. Bioinform. Comput. Biol., 2004)

Protein Threading by Linear Programming: Theoretical Analysis and Computational Results. - Jinbo Xu; Ming Li 001; Ying Xu 001 (J. Comb. Optim., 2004)

A Note on the Single Genotype Resolution Problem. - Hao Lin; Zefeng Zhang; Qiang-Feng Zhang; Dongbo Bu; Ming Li 001 (J. Comput. Sci. Technol., 2004)

Shared information and program plagiarism detection. - Xin Chen; Brent Francia; Ming Li 001; Brian McKinnon; Amit Seker (IEEE Trans. Inf. Theory, 2004)

The similarity metric. - Ming Li 001; Xin Chen; Xin Li; Bin Ma 002; Paul M. B. Vitányi (IEEE Trans. Inf. Theory, 2004)

PRIME: Peptide robust identification from MS/MS spectra. - Jian Liu; Bin Ma 002; Ming Li 001 (APBC, 2005)

Consensus fold recognition by predicted model quality. - Jinbo Xu; Libo Yu; Ming Li 001 (APBC, 2005)

A New Algorithm for Pattern Optimization in Protein-Protein Interaction Extraction System. - Yu Hao 001; Xiaoyan Zhu 001; Ming Li 001 (IbPRIA (2), 2005)

ExonHunter: a comprehensive approach to gene finding. - Brona Brejová; Daniel G. Brown 001; Ming Li 001; Tomás Vinar (ISMB (Supplement of Bioinformatics), 2005)

Discovering Sequence-Structure Motifs from Protein Segments and Two Applications. - Thomas Tang; Jinbo Xu; Ming Li 001 (Pacific Symposium on Biocomputing, 2005)

Discovering patterns to extract protein-protein interactions from the literature: Part II. - Hao Yu 005; Xiaoyan Zhu 001; Minlie Huang; Ming Li 001 (Bioinform., 2005)

tPatternHunter: gapped, fast and sensitive translated homology search . - Derek Kisman; Ming Li 001; Bin Ma 002; Li Wang (Bioinform., 2005)

Finding Cancer Biomarkers from Mass Spectrometry Data by Decision Lists. - Jian Liu; Ming Li 001 (J. Comput. Biol., 2005)

ONBRIRES: Ontology-Based Biological Relation Extraction System. - Minlie Huang; Xiaoyan Zhu 001; Shilin Ding; Hao Yu 005; Ming Li 001 (APBC, 2006)

Information distance. - Ming Li 001 (GrC, 2006)

From Three Ideas in TCS to Three Applications in Bioinformatics. - Ming Li 001 (MFCS, 2006)

Superiority and complexity of the spaced seeds. - Ming Li 001; Bin Ma 002; Louxin Zhang (SODA, 2006)

On the Complexity of the Crossing Contact Map Pattern Matching Problem. - Shuai Cheng Li 001; Ming Li 001 (WABI, 2006)

A hybrid method for relation extraction from biomedical literature. - Minlie Huang; Xiaoyan Zhu 001; Ming Li 001 (Int. J. Medical Informatics, 2006)

Prima: Peptide Robust Identification from Ms/ms Spectra. - Jian Liu; Bin Ma 002; Ming Li 001 (J. Bioinform. Comput. Biol., 2006)

Optimizing Multiple Spaced Seeds for Homology Search. - Jinbo Xu; Daniel G. Brown 001; Ming Li 001; Bin Ma 002 (J. Comput. Biol., 2006)

Information Distance from a Question to an Answer. - Ming Li 001 (COCOON, 2007)

Computing Exact p-Value for Structured Motif. - Jing Zhang 012; Xi Chen 001; Ming Li 001 (CPM, 2007)

Invited Talk: Modern Homology Search. - Ming Li 001 (ISBRA, 2007)

Homology search for genes. - Xuefeng Cui; Tomás Vinar; Brona Brejová; Dennis E. Shasha; Ming Li 001 (ISMB/ECCB (Supplement of Bioinformatics), 2007)

Information distance from a question to an answer. - Xian Zhang 006; Yu Hao 001; Xiaoyan Zhu 001; Ming Li 001; David R. Cheriton (KDD, 2007)

Computing exact P-values for DNA motifs. - Jing Zhang 012; Bo Jiang 005; Ming Li 001; John Tromp; Xuegong Zhang; Michael Q. Zhang (Bioinform., 2007)

Information Distance and its Applications. - Ming Li 001 (Int. J. Found. Comput. Sci., 2007)

Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility. - Brendan Lucier; Tao Jiang 001; Ming Li 001 (Inf. Process. Lett., 2007)

On the complexity of the spaced seeds. - Bin Ma 002; Ming Li 001 (J. Comput. Syst. Sci., 2007)

Near optimal multiple alignment within a band in polynomial time. - Bin Ma 002; Lusheng Wang 001; Ming Li 001 (J. Comput. Syst. Sci., 2007)

Applications of algorithmic information theory. - Ming Li 001; Paul M. B. Vitányi (Scholarpedia, 2007)

Information shared by many objects. - Chong Long; Xiaoyan Zhu 001; Ming Li 001; Bin Ma 002 (CIKM, 2008)

Finding Largest Well-Predicted Subset of Protein Structure Models. - Shuai Cheng Li 001; Dongbo Bu; Jinbo Xu; Ming Li 001 (CPM, 2008)

Designing succinct structural alphabets. - Shuai Cheng Li 001; Dongbo Bu; Xin Gao 001; Jinbo Xu; Ming Li 001 (ISMB, 2008)

Rapid and Accurate Protein Side Chain Prediction with Local Backbone Information. - Jing Zhang 012; Xin Gao 001; Jinbo Xu; Ming Li 001 (RECOMB, 2008)

ZOOM! Zillions of oligos mapped. - Hao Lin; Zefeng Zhang; Michael Q. Zhang; Bin Ma 002; Ming Li 001 (Bioinform., 2008)

Normalized Information Distance - Paul M. B. Vitányi; Frank J. Balbach; Rudi Cilibrasi; Ming Li 001 (CoRR, 2008)

Mango: Multiple Alignment with n Gapped Oligos. - Zefeng Zhang; Hao Lin; Ming Li 001 (J. Bioinform. Comput. Biol., 2008)

New Information Distance Measure and Its Application in Question Answering System. - Xian Zhang 006; Yu Hao 001; Xiaoyan Zhu 001; Ming Li 001 (J. Comput. Sci. Technol., 2008)

Nearest Neighbor Interchange and Related Distances. - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp; Louxin Zhang (Encyclopedia of Algorithms, 2008)

An Introduction to Kolmogorov Complexity and Its Applications, Third Edition. - Ming Li 001; Paul M. B. Vitányi (Springer, 2008)

Multi-document Summarization by Information Distance. - Chong Long; Minlie Huang; Xiaoyan Zhu 001; Ming Li 001 (ICDM, 2009)

Specialized Review Selection for Feature Rating Estimation. - Chong Long; Jie Zhang 002; Minlie Huang; Xiaoyan Zhu 001; Ming Li 001; Bin Ma 002 (Web Intelligence, 2009)

PICKY: a novel SVD-based NMR spectra peak picking method. - Babak Alipanahi; Xin Gao 001; Emre Karakoç; Logan Donaldson; Ming Li 001 (Bioinform., 2009)

Predicting Local Quality of a Sequence-Structure Alignment. - Xin Gao 001; Jinbo Xu; Shuai Cheng Li 001; Ming Li 001 (J. Bioinform. Comput. Biol., 2009)

Can We Determine a Protein Structure Quickly? - Ming Li 001 (J. Comput. Sci. Technol., 2009)

Preface. - Ying Xu 001; Ming Li 001; Tao Jiang 001 (J. Comput. Sci. Technol., 2009)

Finding compact structural motifs. - Dongbo Bu; Ming Li 001; Shuai Cheng Li 001; Jianbo Qian; Jinbo Xu (Theor. Comput. Sci., 2009)

On two open problems of 2-interval patterns. - Shuai Cheng Li 001; Ming Li 001 (Theor. Comput. Sci., 2009)

Measuring the Non-compositionality of Multiword Expressions. - Fan Bu; Xiaoyan Zhu 001; Ming Li 001 (COLING, 2010)

Towards Automated Structure-Based NMR Resonance Assignment. - Richard Jang; Xin Gao 001; Ming Li 001 (RECOMB, 2010)

Protein Secondary Structure Prediction Using NMR Chemical Shift Data. - Yuzhong Zhao; Babak Alipanahi; Shuai Cheng Li 001; Ming Li 001 (J. Bioinform. Comput. Biol., 2010)

A New Approach for Multi-Document Update Summarization. - Chong Long; Minlie Huang; Xiaoyan Zhu 001; Ming Li 001 (J. Comput. Sci. Technol., 2010)

Information Distance and Its Extensions. - Ming Li 001 (ALT, 2011)

Combining ambiguous chemical shift mapping with structure-based backbone and NOE assignment from 15N-NOESY. - Richard Jang; Xin Gao 001; Ming Li 001 (BCB, 2011)

Partial Match Distance - In Memoriam Ray Solomonoff 1926-2009. - Ming Li 001 (Algorithmic Probability and Friends, 2011)

Error Tolerant NMR Backbone Resonance Assignment and Automated Structure Generation. - Babak Alipanahi; Xin Gao 001; Emre Karakoç; Shuai Cheng Li 001; Frank J. Balbach; Guangyu Feng; Logan Donaldson; Ming Li 001 (J. Bioinform. Comput. Biol., 2011)

Towards Fully Automated Structure-Based NMR Resonance Assignment of 15N-Labeled Proteins From Automatically Picked Peaks. - Richard Jang; Xin Gao 001; Ming Li 001 (J. Comput. Biol., 2011)

Finding Nearly Optimal GDT Scores. - Shuai Cheng Li 001; Dongbo Bu; Jinbo Xu; Ming Li 001 (J. Comput. Biol., 2011)

A New Multiword Expression Metric and Its Applications. - Fan Bu; Xiaoyan Zhu 001; Ming Li 001 (J. Comput. Sci. Technol., 2011)

(2) Protein structure determination on demand. - Ming Li 001 (BIBM, 2012)

Classifying Stem Cell Differentiation Images by Information Distance. - Xianglilan Zhang; Hongnan Wang; Tony J. Collins; Zhigang Luo; Ming Li 001 (ECML/PKDD (1), 2012)

Protein Structure by Semidefinite Facial Reduction. - Babak Alipanahi; Nathan Krislock; Ali Ghodsi 001; Henry Wolkowicz; Logan Donaldson; Ming Li 001 (RECOMB, 2012)

How Accurately Can We Model Protein Structures with Dihedral Angles? - Xuefeng Cui; Shuai Cheng Li 001; Dongbo Bu; Babak Alipanahi Ramandi; Ming Li 001 (WABI, 2012)

Combining automated peak tracking in SAR by NMR with structure-based backbone assignment from 15N-NOESY. - Richard Jang; Xin Gao 001; Ming Li 001 (BMC Bioinform., 2012)

Residues with Similar Hexagon Neighborhoods Share Similar Side-Chain Conformations. - Shuai Cheng Li 001; Dongbo Bu; Ming Li 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

Clustering 100, 000 Protein Structure Decoys in Minutes. - Shuai Cheng Li 001; Dongbo Bu; Ming Li 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

Towards Reliable Automatic Protein Structure Alignment. - Xuefeng Cui; Shuai Cheng Li 001; Dongbo Bu; Ming Li 001 (WABI, 2013)

Protein Structure Idealization: How accurately is it possible to model protein structures with dihedral angles? - Xuefeng Cui; Shuai Cheng Li 001; Dongbo Bu; Babak Alipanahi; Ming Li 001 (Algorithms Mol. Biol., 2013)

Information distance between what I said and what it heard. - Yang Tang; Di Wang; Jing Bai; Xiaoyan Zhu 001; Ming Li 001 (Commun. ACM, 2013)

Determining Protein Structures from NOESY Distance Constraints by Semidefinite Programming. - Babak Alipanahi; Nathan Krislock; Ali Ghodsi 001; Henry Wolkowicz; Logan Donaldson; Ming Li 001 (J. Comput. Biol., 2013)

LoopWeaver: Loop Modeling by the Weighted Scaling of Verified Proteins. - Daniel Holtby; Shuai Cheng Li 001; Ming Li 001 (J. Comput. Biol., 2013)

Formal Models and Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar (Computing Handbook, 3rd ed. (1), 2014)

Fingerprinting protein structures effectively and efficiently. - Xuefeng Cui; Shuai Cheng Li 001; Lin He 002; Ming Li 001 (Bioinform., 2014)

JBCB, the first decade. - John C. Wooley; Ming Li 001; Limsoon Wong (J. Bioinform. Comput. Biol., 2014)

Merge-Weighted Dynamic Time Warping for Speech Recognition. - Xianglilan Zhang; Zhigang Luo; Ming Li 001 (J. Comput. Sci. Technol., 2014)

Estimating feature ratings through an effective review selection approach. - Chong Long; Jie Zhang 002; Minlie Huang; Xiaoyan Zhu 001; Ming Li 001; Bin Ma 002 (Knowl. Inf. Syst., 2014)

Question Classification by Approximating Semantics. - Guangyu Feng; Kun Xiong; Yang Tang; Anqi Cui; Jing Bai; Hang Li 001; Qiang Yang 001; Ming Li 001 (WWW (Companion Volume), 2015)

John Wooley and JBCB. - Ming Li 001; Limsoon Wong (J. Bioinform. Comput. Biol., 2015)

UWNLP at the NTCIR-12 Short Text Conversation Task. - Anqi Cui; Guangyu Feng; Borui Ye; Kun Xiong; Xing Yi Liu; Ming Li 001 (NTCIR, 2016)

Neural Contextual Conversation Learning with Labeled Question-Answering Pairs. - Kun Xiong; Anqi Cui; Zefeng Zhang; Ming Li 001 (CoRR, 2016)

Nearest Neighbor Interchange and Related Distances. - Bhaskar DasGupta; Xin He 005; Ming Li 001; John Tromp; Louxin Zhang (Encyclopedia of Algorithms, 2016)

Closest String and Substring Problems. - Lusheng Wang 001; Ming Li 001; Bin Ma 002 (Encyclopedia of Algorithms, 2016)

Enhanced question understanding with dynamic memory networks for textual question answering. - Chunyi Yue; Hanqiang Cao; Kun Xiong; Anqi Cui; Haocheng Qin; Ming Li 001 (Expert Syst. Appl., 2017)

Challenges from Cancer Immunotherapy. - Ming Li 001 (COCOON, 2018)

Detecting Customer Complaint Escalation with Recurrent Neural Networks and Manually-Engineered Features. - Wei Yang 017; Luchen Tan; Chunwei Lu; Anqi Cui; Han Li; Xi Chen 001; Kun Xiong; Muzi Wang; Ming Li 001; Jian Pei 001; Jimmy Lin (NAACL-HLT (2), 2019)

End-to-End Open-Domain Question Answering with BERTserini. - Wei Yang 017; Yuqing Xie 001; Aileen Lin; Xingyu Li; Luchen Tan; Kun Xiong; Ming Li 001; Jimmy Lin (NAACL-HLT (Demonstrations), 2019)

Data Augmentation for BERT Fine-Tuning in Open-Domain Question Answering. - Wei Yang 017; Yuqing Xie 001; Luchen Tan; Kun Xiong; Ming Li 001; Jimmy Lin (CoRR, 2019)

DeepNovoV2: Better de novo peptide sequencing with deep learning. - Rui Qiao 001; Ngoc Hieu Tran; Ming Li 001; Lei Xin; Baozhen Shan; Ali Ghodsi 001 (CoRR, 2019)

Deep Learning Deciphers Protein-RNA Interaction. - Ming Li 001 (Genom. Proteom. Bioinform., 2019)

An Introduction to Kolmogorov Complexity and Its Applications, 4th Edition - Ming Li 001; Paul M. B. Vitányi (Springer, 2019)

Two Birds, One Stone: A Simple, Unified Model for Text Generation from Structured and Unstructured Data. - Hamidreza Shahidi; Ming Li 001; Jimmy Lin (ACL, 2020)

Approximate Nearest Neighbor Search and Lightweight Dense Vector Reranking in Multi-Stage Retrieval Architectures. - Zhengkai Tu; Wei Yang 017; Zihang Fu; Yuqing Xie 001; Luchen Tan; Kun Xiong; Ming Li 001; Jimmy Lin (ICTIR, 2020)

Distant Supervision for Multi-Stage Fine-Tuning in Retrieval-Based Question Answering. - Yuqing Xie 001; Wei Yang 017; Luchen Tan; Kun Xiong; Nicholas Jing Yuan; Baoxing Huai; Ming Li 001; Jimmy Lin (WWW, 2020)

Semantics of the Unwritten. - He Bai 002; Peng Shi 010; Jimmy Lin; Luchen Tan; Kun Xiong; Wen Gao 001; Jie Liu 035; Ming Li 001 (CoRR, 2020)

SegaBERT: Pre-training of Segment-aware BERT for Language Understanding. - He Bai 002; Peng Shi 010; Jimmy Lin; Luchen Tan; Kun Xiong; Wen Gao 001; Ming Li 001 (CoRR, 2020)

To Paraphrase or Not To Paraphrase: User-Controllable Selective Paraphrase Generation. - Mohan Zhang; Luchen Tan; Zhengkai Tu; Zihang Fu; Kun Xiong; Ming Li 001; Jimmy Lin (CoRR, 2020)

Latte-Mix: Measuring Sentence Semantic Similarity with Latent Categorical Mixtures. - Minghan Li 002; He Bai 002; Luchen Tan; Kun Xiong; Ming Li 001; Jimmy Lin (CoRR, 2020)

Personalized deep learning of individual immunopeptidomes to identify neoantigens for cancer vaccines. - Ngoc Hieu Tran; Rui Qiao 001; Lei Xin; Xin Chen; Baozhen Shan; Ming Li 001 (Nat. Mach. Intell., 2020)

Segatron: Segment-Aware Transformer for Language Modeling and Understanding. - He Bai 002; Peng Shi 010; Jimmy Lin; Yuqing Xie 001; Luchen Tan; Kun Xiong; Wen Gao 001; Ming Li 001 (AAAI, 2021)

Semantics of the Unwritten: The Effect of End of Paragraph and Sequence Tokens on Text Generation with GPT2. - He Bai 002; Peng Shi 010; Jimmy Lin; Luchen Tan; Kun Xiong; Wen Gao 001; Jie Liu 035; Ming Li 001 (ACL (student), 2021)

Don't Change Me! User-Controllable Selective Paraphrase Generation. - Mohan Zhang; Luchen Tan; Zihang Fu; Kun Xiong; Jimmy Lin; Ming Li 001; Zhengkai Tu (EACL, 2021)

Unsupervised Chunking as Syntactic Structure Induction with a Knowledge-Transfer Approach. - Anup Anand Deshmukh; Qianqiu Zhang; Ming Li 001; Jimmy Lin; Lili Mou (EMNLP (Findings), 2021)

Multi-Task Dense Retrieval via Model Uncertainty Fusion for Open-Domain Question Answering. - Minghan Li 002; Ming Li 001; Kun Xiong; Jimmy Lin (EMNLP (Findings), 2021)

Computationally instrument-resolution-independent de novo peptide sequencing for high-resolution devices. - Rui Qiao 001; Ngoc Hieu Tran; Lei Xin; Xin Chen; Ming Li 001; Baozhen Shan; Ali Ghodsi 001 (Nat. Mach. Intell., 2021)

ChimST: An Efficient Spectral Library Search Tool for Peptide Identification from Chimeric Spectra in Data-Dependent Acquisition. - Wenju Zhang; Zhewei Liang; Xin Chen; Lei Xin; Baozhen Shan; Zhigang Luo; Ming Li 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

Few-Shot Non-Parametric Learning with Deep Latent Variable Model. - Zhiying Jiang; Yiqin Dai; Ji Xin; Ming Li 001; Jimmy Lin (NeurIPS, 2022)

A tale of solving two computational challenges in protein science: neoantigen prediction and protein structure prediction. - Ngoc Hieu Tran; Jinbo Xu; Ming Li 001 (Briefings Bioinform., 2022)

Approximating Human-Like Few-shot Learning with GPT-based Compression. - Cynthia Huang; Yuqing Xie 001; Zhiying Jiang; Jimmy Lin; Ming Li 001 (CoRR, 2023)

Mitigating the missing-fragmentation problem in de novo peptide sequencing with a two-stage graph-based deep learning model. - Zeping Mao; Ruixue Zhang; Lei Xin; Ming Li 001 (Nat. Mac. Intell., 2023)

Understanding is Compression. - Ziguang Li; Chao Huang; Xuliang Wang; Haibo Hu; Cole Wyeth; Dongbo Bu; Quan Yu; Wen Gao 001; Xingwu Liu; Ming Li 001 (CoRR, 2024)

Disentangling the Complex Multiplexed DIA Spectra in De Novo Peptide Sequencing. - Zheng Ma 011; Zeping Mao; Ruixue Zhang; Jiazhen Chen; Lei Xin; Paul Shan; Ali Ghodsi 001; Ming Li 001 (CoRR, 2024)

Towards highly sensitive deep learning-based end-to-end database search for tandem mass spectrometry. - Yonghan Yu; Ming Li 001 (Nat. Mac. Intell., 2025)