Pages that link to "Item:Q3319776"
From MaRDI portal
The following pages link to Fast Algorithms for Finding Nearest Common Ancestors (Q3319776):
Displaying 50 items.
- Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
- Recursive voids for identifying a nonconvex boundary of a set of points in the plane (Q898221) (← links)
- Computing runs on a general alphabet (Q903195) (← links)
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis (Q903597) (← links)
- Ramified rectilinear polygons: coordinatization by dendrons (Q908206) (← links)
- String matching with weighted errors (Q909451) (← links)
- Recognizing breadth-first search trees in linear time (Q911287) (← links)
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time (Q924140) (← 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)
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
- Range mode and range median queries in constant time and sub-quadratic space (Q976080) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- New common ancestor problems in trees and directed acyclic graphs (Q991797) (← links)
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks (Q996826) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- Efficient algorithms for two generalized 2-median problems and the group median problem on trees (Q1006061) (← links)
- The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Real two dimensional scaled matching (Q1024780) (← links)
- Matching subsequences in trees (Q1026243) (← links)
- Data compression for proof replay (Q1040776) (← links)
- Two flow network simplification algorithms (Q1045934) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Parallel string matching with k mismatches (Q1098311) (← links)
- Computing on a free tree via complexity-preserving mappings (Q1098314) (← links)
- An \(O(ND)\) difference algorithm and its variations (Q1099955) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- A log log n data structure for three-sided range queries (Q1108025) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
- An efficient algorithm for some tree matching problems (Q1182118) (← links)
- Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses (Q1183475) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
- Two-dimensional dictionary matching (Q1209347) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- A uniform approach to semi-dynamic problems on digraphs (Q1274321) (← links)
- A fast and simple Steiner routing heuristic (Q1276958) (← links)
- New algorithms for the LCA problem and the binary tree reconstruction problem (Q1328757) (← links)
- Finding level-ancestors in trees (Q1329158) (← links)
- Finding lowest common ancestors in arbitrarily directed trees (Q1330662) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Unit-cost pointers versus logarithmic-cost addresses (Q1334674) (← links)
- Pattern matching in a digitized image (Q1336966) (← links)
- A constant update time finger search tree (Q1338781) (← links)
- Almost fully-parallel parentheses matching (Q1345960) (← links)
- Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
- A note on finding compact sets in graphs represented by an adjacency list (Q1351637) (← links)
