Eertree: Difference between revisions
Content added Content deleted
m (added a Wikipedia link to: "trie".) |
Walterpachl (talk | contribs) m (tried to fix the links) |
||
| Line 5: | Line 5: | ||
An '''eertree''' is a data structure designed for efficient processing of certain palindrome tasks, for instance counting the number of sub-palindromes in an input string. |
An '''eertree''' is a data structure designed for efficient processing of certain palindrome tasks, for instance counting the number of sub-palindromes in an input string. |
||
The data structure has commonalities to both |
The data structure has commonalities to both ''tries'' and ''suffix trees''. |
||
See links below. |
|||
;Task: |
;Task: |
||
| Line 14: | Line 14: | ||
;See also: |
;See also: |
||
* Wikipedia entry: [https://en.wikipedia.org/wiki/Trie trie]. |
* Wikipedia entry: [https://en.wikipedia.org/wiki/Trie trie]. |
||
* Wikipedia entry: [https://en.wikipedia.org/wiki/Suffix_tree suffix tree] |
|||
* [https://arxiv.org/abs/1506.04862 Cornell University Library, Computer Science, Data Structures and Algorithms ───► EERTREE: An Efficient Data Structure for Processing Palindromes in Strings]. |
* [https://arxiv.org/abs/1506.04862 Cornell University Library, Computer Science, Data Structures and Algorithms ───► EERTREE: An Efficient Data Structure for Processing Palindromes in Strings]. |
||
<br><br> |
<br><br> |
||