#7642: Add an implementation of LCA to sage.combinat.words.suffix_trees
-----------------------------+----------------------------------------------
Reporter: abergeron | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone:
Component: combinatorics | Keywords: lca suffix_tree
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
-----------------------------+----------------------------------------------
I have implemented the linear time preprocessing, constant-time queries
algorithm for the lowest common ancestor (LCA) in the context of the
suffix trees for words.
The only thing I'm not very sure about is where to place the bit
manipulation functions.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7642>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
