A note on the longest common compatible prefix problem for partial words (Q491152): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61677838, #quickstatements; #temporary_batch_1719332822301 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Algorithmic Combinatorics on Partial Words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms on Strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4449231 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4547749 / rank | |||
Normal rank | |||
Revision as of 16:04, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the longest common compatible prefix problem for partial words |
scientific article |
Statements
A note on the longest common compatible prefix problem for partial words (English)
0 references
24 August 2015
0 references
partial word
0 references
longest common compatible prefix
0 references
longest common prefix
0 references
dynamic programming
0 references
