The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees (Q3590985): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-540-70901-5_7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1953626159 / rank | |||
Normal rank |
Latest revision as of 21:17, 19 March 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