A note on the longest common compatible prefix problem for partial words (Q491152): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2015.05.003
@@ Property / DOI: 10.1016/j.jda.2015.05.003 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.2381
@@ Property / arXiv ID: 1312.2381 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q61677838
@@ Property / Wikidata QID: Q61677838 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Combinatorics on Partial Words
@@ Property / cites work: Algorithmic Combinatorics on Partial Words / rank @@
+Normal rank
@@ Property / cites work @@
+Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings
@@ Property / cites work: Algorithms on Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Q4449231
@@ Property / cites work: Q4449231 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4547749
@@ Property / cites work: Q4547749 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jda/CrochemoreIKKLR15
@@ Property / DBLP publication ID: journals/jda/CrochemoreIKKLR15 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2015.05.003
@@ Property / DOI: 10.1016/J.JDA.2015.05.003 / rank @@
+Normal rank