Suffix tries: size

Here I discuss both some theory and some empirical results regarding the size of suffix tries, which grow quadratically with the length of the text.
These materials are also openly available on figshare. Please cite this work; this ensures that funding agencies see the impact and importance of these open learning materials.
Langmead, Ben (2024). Suffix-based indexing data structures: learning materials. figshare. Collection. doi.org/10.608...
Channel: ‪@BenLangmead‬
Playlist: • Suffix Indexing
Related playlist with videos on pattern matching and substring indexes: • Algorithms for DNA Seq...
Related playlist with videos on Burrows-Wheeler indexing approaches: • Burrows-Wheeler Indexing
More materials: www.langmead-la...

[@transinh398]

You doing a great jobs! Thank you ^^^^

[@field-yetian6001]

I must be wrong but I feel that the storage of the connections between node and edge should also comsume some space? So the real space comsumptioin should be larger than 0.5*m^2, especially for those not well patterned strings?