Pages that link to "Item:Q3319776"
From MaRDI portal
The following pages link to Fast Algorithms for Finding Nearest Common Ancestors (Q3319776):
Displaying 18 items.
- Longest common extensions in trees (Q294947) (← links)
- Order-preserving indexing (Q294954) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- Matching subsequences in trees (Q1026243) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Finding level-ancestors in trees (Q1329158) (← links)
- A data structure for dynamic trees (Q1838310) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Planarity of streamed graphs (Q2333805) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)