A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees - researchr publication references

researchr

You are not signed in
Sign in
Sign up

Mauricio Ayala-Rincón, Paulo D. Conejo. A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees. Algorithmica, 37(3):233-241, 2003. [doi]

No references recorded for this publication.

No citations of this publication recorded.

runs on WebDSL