Re: [Seqan-dev] Suffix links
- From: "Weese, David" <weese@campus.fu-berlin.de>
- To: SeqAn Development <seqan-dev@lists.fu-berlin.de>
- Date: Wed, 05 Jun 2013 10:02:37 +0200
- Reply-to: SeqAn Development <seqan-dev@lists.fu-berlin.de>
- Subject: Re: [Seqan-dev] Suffix links
Hi John,
we not yet have suffix links in our suffix trees. There are two papers proposing how to post-compute a suffix link table on top of an enhanced suffix array:
Abouelhoda, M., Kurtz, S., & Ohlebusch, E. (2004). Replacing suffix trees with enhanced suffix arrays.
Journal of Discrete Algorithms, 2(1), 53–86.
or on any suffix tree/array:
Maaß, M. G. (2007). Computing suffix links for suffix trees and arrays.
Information Processing Letters, 101(6), 250–254. doi:10.1016/j.ipl.2005.12.012
I haven't looked how they are implemented and which one is faster or more practical for large datasets. Maybe you can use the implementation and tell us about your experiences or we'll find a Bsc/MSc. student to try them out.
Cheers,
David
Am 31.05.2013 um 20:38 schrieb John Reid <j.reid@mail.cryst.bbk.ac.uk>:
Hi, |
- Follow-Ups:
- Re: [Seqan-dev] Suffix links
- From: John Reid <j.reid@mail.cryst.bbk.ac.uk>
- Re: [Seqan-dev] Suffix links
-
seqan-dev - June 2013 - Archives indexes sorted by:
[ thread ] [ subject ] [ author ] [ date ] - Complete archive of the seqan-dev mailing list
- More info on this list...