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.
- Online timestamped text indexing (Q294884) (← links)
- Longest common extensions in trees (Q294947) (← links)
- Order-preserving indexing (Q294954) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- Efficient algorithms for local ranking (Q436589) (← links)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Linear-time version of Holub's algorithm for morphic imprimitivity testing (Q497670) (← links)
- On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- On Cartesian trees and range minimum queries (Q528853) (← links)
- Fitting a step function to a point set (Q547281) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Bounded hairpin completion (Q553314) (← links)
- Building species trees from larger parts of phylogenomic databases (Q553332) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
- An efficient algorithm for sequence comparison with block reversals (Q596144) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- A scalable parallelization of the gene duplication problem (Q666045) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Moving a disc between polygons (Q749237) (← links)
- On rectilinear link distance (Q808302) (← links)
- Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
- Common intervals of trees (Q834996) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- Drawing \(c\)-planar biconnected clustered graphs (Q885287) (← links)
- A faster computation of all the best swap edges of a shortest paths tree (Q893317) (← links)
- Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
