The following pages link to Kun-Mao Chao (Q294614):
Displaying 50 items.
- An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Efficient algorithms for local ranking (Q436589) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Finding all sorting tandem duplication random loss operations (Q533407) (← links)
- A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252) (← links)
- A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
- Sequence comparison. Theory and methods (Q947472) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- The 2-radius and 2-radiian problems on trees (Q955029) (← links)
- Optimal algorithms for the average-constrained maximum-sum segment problem (Q976064) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- On locating disjoint segments with maximum sum of densities (Q1024216) (← links)
- Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint (Q1044737) (← links)
- Constrained sequence alignment (Q1209899) (← links)
- On computing all suboptimal alignments (Q1291563) (← links)
- Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices (Q1306399) (← links)
- Approximation algorithms for some optimum communication spanning tree problems (Q1566575) (← links)
- Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
- Finding a length-constrained maximum-density path in a tree (Q1781798) (← links)
- Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. (Q1872726) (← links)
- Linear-space algorithms that build local alignments from fragments (Q1902469) (← links)
- A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- Proof of a conjecture about minimum spanning tree cycle intersection (Q2172386) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- On the range maximum-sum segment query problem (Q2384388) (← links)
- A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering (Q2465638) (← links)
- The swap edges of a multiple-sources routing tree (Q2479532) (← links)
- Improved algorithms for the \(k\) maximum-sums problems (Q2508973) (← links)
- Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
- An Optimal Algorithm for the Popular Condensation Problem (Q2870048) (← links)
- Computing Plurality Points and Condorcet Points in Euclidean Space (Q2872133) (← links)
- Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics (Q2898029) (← links)
- The Generalized Popular Condensation Problem (Q2942664) (← links)
- Identifying Approximate Palindromes in Run-Length Encoded Strings (Q3060786) (← links)
- FINDING ALL APPROXIMATE GAPPED PALINDROMES (Q3069733) (← links)
- MINKOWSKI SUM SELECTION AND FINDING (Q3089093) (← links)
- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings (Q3586482) (← links)
- Minkowski Sum Selection and Finding (Q3596741) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- Finding All Sorting Tandem Duplication Random Loss Operations (Q3637121) (← links)
- Finding All Approximate Gapped Palindromes (Q3652294) (← links)
- (Q4218433) (← links)
- (Q4250159) (← links)
- Spanning Trees and Optimization Problems (Q4443626) (← links)
- A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees (Q4500852) (← links)
- Light graphs with small routing cost (Q4537619) (← links)
- (Q4708595) (← links)
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (Q4943844) (← links)
