The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees (Q3590985): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:18, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees |
scientific article |
Statements
The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees (English)
0 references
3 September 2007
0 references
