Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Extending to a faster algorithm #15

Open
fcharras opened this issue Jul 6, 2019 · 0 comments
Open

Extending to a faster algorithm #15

fcharras opened this issue Jul 6, 2019 · 0 comments

Comments

@fcharras
Copy link
Contributor

fcharras commented Jul 6, 2019

This issue to let you know that I've re-used your strategy for wrapping the C code from Yuta Mori, applied to an enhanced version found here: https://github.com/kurpicz/sais-lite-lcp . This enhancement enables computing SA and LCP arrays simultaneously, and I have yet to find a segfault. According to wikipedia it was also the most efficient algorithm as of 2012.

My fork it there: https://github.com/fcharras/pyfischer

I've only ported the functions that meet my usecases, but the other functions could be ported too.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant