The following pages link to Ming Li (Q672057):
Displaying 50 items.
- DNA sequencing and string learning (Q3445271) (← links)
- (Q3493263) (← links)
- INFORMATION DISTANCE AND ITS APPLICATIONS (Q3503084) (← links)
- Finding Compact Structural Motifs (Q3506917) (← links)
- Computing Exact p-Value for Structured Motif (Q3506919) (← links)
- Finding Largest Well-Predicted Subset of Protein Structure Models (Q3506941) (← links)
- Shared Information and Program Plagiarism Detection (Q3546694) (← links)
- The Similarity Metric (Q3547244) (← links)
- Superiority and complexity of the spaced seeds (Q3581496) (← links)
- Normalized Information Distance (Q3613556) (← links)
- (Q3690223) (← links)
- (Q3751011) (← links)
- (Q3783554) (← links)
- (Q3801071) (← links)
- (Q3815511) (← links)
- Learning Simple Concepts under Simple Distributions (Q3982714) (← links)
- (Q4013557) (← links)
- The Power of the Queue (Q4016402) (← links)
- (Q4023358) (← links)
- (Q4035322) (← links)
- (Q4218410) (← links)
- (Q4247446) (← links)
- (Q4250182) (← links)
- (Q4252331) (← links)
- (Q4252342) (← links)
- Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions (Q4264492) (← links)
- Statistical properties of finite sequences with high Kolmogorov complexity (Q4301638) (← links)
- Linear approximation of shortest superstrings (Q4310837) (← links)
- (Q4327318) (← links)
- Learning Boolean formulas (Q4327633) (← links)
- (Q4336271) (← links)
- (Q4337021) (← links)
- How to share concurrent wait-free variables (Q4371684) (← links)
- (Q4385509) (← links)
- (Q4471384) (← links)
- (Q4471962) (← links)
- Minimum description length induction, Bayesianism, and Kolmogorov complexity (Q4503537) (← links)
- From Gene Trees to Species Trees (Q4507371) (← links)
- (Q4519914) (← links)
- The average‐case area of Heilbronn‐type triangles* (Q4543628) (← links)
- Lower bounds on learning decision lists and trees (Q4596650) (← links)
- On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
- Information distance (Q4701113) (← links)
- New lower bounds for parallel computation (Q4710687) (← links)
- (Q4732131) (← links)
- (Q4808662) (← links)
- Selecting the branches for an evolutionary tree. (Q4818669) (← links)
- A New Approach to Formal Language Theory by Kolmogorov Complexity (Q4834389) (← links)
- (Q4840106) (← links)
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (Q4857599) (← links)
