The following pages link to Tao Jiang (Q185445):
Displaying 50 items.
- (Q242866) (redirect page) (← links)
- (Q587940) (redirect page) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- \(k\) one-way heads cannot do string-matching (Q676454) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- A network flow approach to the minimum common integer partition problem (Q861289) (← links)
- The longest common subsequence problem for arc-annotated sequences (Q876717) (← links)
- On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals (Q917283) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops (Q965820) (← links)
- Relating the power of cellular arrays to their closure properties (Q1104098) (← links)
- Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
- Optimal simulation of tree arrays by linear arrays (Q1120283) (← links)
- On iterative and cellular tree arrays (Q1124336) (← links)
- On the linear-cost subtree-transfer distance between phylogenetic trees (Q1125442) (← links)
- Learning regular languages from counterexamples (Q1176104) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- Parallel parsing on a one-way linear array of finite-state machines (Q1183569) (← links)
- The synchronization of nonuniform networks of finite automata (Q1187031) (← links)
- A hierarchy result for 2-dimensional TM's operating in small space (Q1193691) (← links)
- A characterization of exponential-time languages by alternating context- free grammars (Q1193905) (← links)
- A note on shortest superstrings with flipping (Q1208439) (← links)
- On the complexity and approximation of syntenic distance (Q1281760) (← links)
- Aligning DNA sequences to minimize the change in protein (Q1306402) (← links)
- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata (Q1318689) (← links)
- Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
- Approximating shortest superstrings with constraints (Q1341729) (← links)
- Mapping clones with a given ordering or interleaving (Q1393069) (← links)
- Average-case analysis of algorithms using Kolmogorov complexity (Q1587331) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- A further improved approximation algorithm for breakpoint graph decomposition (Q1768609) (← links)
- The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
- Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. (Q1872726) (← links)
- Approximation algorithms for NMR spectral peak assignment. (Q1874392) (← links)
- Decision problems for patterns (Q1892205) (← links)
- Lower bounds on learning decision lists and trees (Q1917100) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- New applications of the incompressibility method. II (Q1978700) (← links)
- Uniformly asymptotic behavior of ruin probabilities in a time-dependent renewal risk model with stochastic return (Q2346633) (← links)
- Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806) (← links)
- Average-case analysis of quicksort and binary insertion tree height using incompressibility (Q2379940) (← links)
- OMGS: optical map-based genome scaffolding (Q2415267) (← links)
- An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants (Q2428680) (← links)
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem (Q2464382) (← links)
- A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application (Q2719117) (← links)
- (Q2723948) (← links)
- (Q2766831) (← links)
- Two heads are better than two tapes (Q2817660) (← links)
- Aligning sequences via an evolutionary tree: complexity and approximation (Q2817672) (← links)
