Journals
Publish with us
Publishing partnerships
About us
Blog
BioMed Research International
Journal overview
For authors
For reviewers
For editors
Table of Contents
Special Issues
BioMed Research International
/
2014
/
Article
/
Tab 1
/
Research Article
Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
Table 1
Comparison between the two methods in term of time and space complexity. Time and space used for output are ignored.
Algorithm
Used data structures
Time complexity
Space complexity
First method
BP and CSA
Second method
BP, LCP and CSA