The following pages link to Louxin Zhang (Q491207):
Displaying 50 items.
- Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction (Q491208) (← links)
- Analyzing the fitch method for reconstructing ancestral states on ultrametric phylogenetic trees (Q611942) (← links)
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences (Q673078) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
- Recent progresses in the combinatorial and algorithmic study of rooted phylogenetic networks (Q782149) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- Sequence comparison. Theory and methods (Q947472) (← links)
- Rational strong codes and structure of rational group languages (Q1089439) (← links)
- A characterization of rational star languages generated by strong codes (Q1092172) (← links)
- (Q1123271) (redirect page) (← links)
- An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group (Q1123272) (← links)
- On the descriptive power of special Thue systems (Q1126309) (← links)
- Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis (Q1127333) (← links)
- Conjugacy in special monoids (Q1178900) (← links)
- Some properties of finite special string-rewriting systems (Q1201349) (← links)
- The pre-NTS property is undecidable for context-free grammars (Q1208437) (← links)
- Fitting distances by tree metrics with increment error (Q1306400) (← links)
- Small weight bases for Hamming codes (Q1391316) (← links)
- Distinguishing string selection problems. (Q1427861) (← links)
- Solving the tree containment problem in linear time for nearly stable phylogenetic networks (Q1647836) (← links)
- A PTAS for the \(k\)-consensus structures problem under squared Euclidean distance (Q1662431) (← links)
- Online buffer management for transmitting packets with processing cycles (Q1708032) (← links)
- Sensitivity analysis and efficient method for identifying optimal spaced seeds (Q1878677) (← links)
- Two results about the Sackin and Colless indices for phylogenetic trees and their shapes (Q2105803) (← links)
- Asymptotic enumeration and distributional properties of galled networks (Q2120821) (← links)
- The Sackin index of simplex networks (Q2163945) (← links)
- Counting and enumerating galled networks (Q2192120) (← links)
- Counting and enumerating tree-child networks and their subclasses (Q2194860) (← links)
- On the asymptotic growth of the number of tree-child networks (Q2225459) (← links)
- Algorithmic and complexity issues of three clustering methods in microarray data analysis (Q2384782) (← links)
- The consecutive ones submatrix problem for sparse matrices (Q2642313) (← links)
- Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time (Q2798232) (← links)
- Locating a Tree in a Phylogenetic Network in Quadratic Time (Q2814579) (← links)
- A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree (Q2867119) (← links)
- (Q2934650) (← links)
- (Q3030263) (← links)
- (Q3358947) (← links)
- A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance (Q3507316) (← links)
- Superiority and complexity of the spaced seeds (Q3581496) (← links)
- Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment (Q3631898) (← links)
- A Short Proof of a Theorem of Adjan (Q4022075) (← links)
- ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER (Q4039449) (← links)
- (Q4218410) (← links)
- (Q4247446) (← links)
- (Q4252342) (← links)
- Optimal Bounds for Matching Routing on Trees (Q4255808) (← links)
- Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions (Q4264492) (← links)
- (Q4347991) (← links)
- (Q4348040) (← links)
