[Seqan-dev] Simple radix tree for a set of strings
- From: "Tran Ngoc Hieu (Dr)" <NHTran@ntu.edu.sg>
- To: "seqan-dev@lists.fu-berlin.de" <seqan-dev@lists.fu-berlin.de>
- Date: Fri, 24 Jul 2015 06:24:50 +0000
- Reply-to: SeqAn Development <seqan-dev@lists.fu-berlin.de>
- Subject: [Seqan-dev] Simple radix tree for a set of strings
Dear All,
Could you please advise if there is any built-in way to construct a simple radix tree of a given set of strings? I don’t need random access to prefixes or suffixes of individual strings. I only need a DFS iterator to traverse from the first to the last character of each string.
A simple example: if my set is {“to”, “tea”, “ten”}, then I need to process in this order: “t”, “te”, “tea”, “ten”, “to”.
I know that some built-in SeqAn indices, e.g. IndexSa, can do what I want, and even offer more support but they also require more memory space. So is there any simple way to do that?
Thanks a lot!
Regards, Hieu
CONFIDENTIALITY: This email is intended solely for the person(s) named and may be confidential and/or privileged. If you are not the intended recipient, please delete it, notify us and do not copy, use, or disclose its contents. Towards a sustainable earth: Print only when necessary. Thank you. |
-
seqan-dev - July 2015 - Archives indexes sorted by:
[ thread ] [ subject ] [ author ] [ date ] - Complete archive of the seqan-dev mailing list
- More info on this list...