Menu

Tree [r7] /
 History

HTTPS access


File Date Author Commit
 DSASampling.cpp 2009-12-11 mikael-salson [r1] Initial version
 DSASampling.h 2009-12-11 mikael-salson [r1] Initial version
 Makefile 2011-05-27 mikael-salson [r7] Added a new file which shows how to use the mos...
 README 2009-12-11 mikael-salson [r1] Initial version
 customTree.cpp 2009-12-11 mikael-salson [r1] Initial version
 customTree.h 2009-12-11 mikael-salson [r1] Initial version
 dep.mk 2010-09-28 mikael-salson [r3]
 dynSA.cpp 2010-01-09 mikael-salson [r2] Bug correction, thanks to Gail Carmichael.
 dynSA.h 2009-12-11 mikael-salson [r1] Initial version
 example.cpp 2011-05-27 mikael-salson [r7] Added a new file which shows how to use the mos...
 gRankS.cpp 2009-12-11 mikael-salson [r1] Initial version
 gRankS.h 2009-12-11 mikael-salson [r1] Initial version
 intTree.cpp 2009-12-11 mikael-salson [r1] Initial version
 intTree.h 2009-12-11 mikael-salson [r1] Initial version
 lcp.cpp 2009-12-11 mikael-salson [r1] Initial version
 lcp.h 2009-12-11 mikael-salson [r1] Initial version
 linkedTree.h 2009-12-11 mikael-salson [r1] Initial version
 locate.cpp 2009-12-11 mikael-salson [r1] Initial version
 lpermutation.cpp 2009-12-11 mikael-salson [r1] Initial version
 lpermutation.h 2009-12-11 mikael-salson [r1] Initial version
 permutation.cpp 2009-12-11 mikael-salson [r1] Initial version
 permutation.h 2009-12-11 mikael-salson [r1] Initial version
 rbtree.cpp 2010-09-28 mikael-salson [r5] Bug correction relative to red-black trees
 rbtree.h 2010-09-28 mikael-salson [r5] Bug correction relative to red-black trees
 sbvtree.cpp 2010-09-28 mikael-salson [r5] Bug correction relative to red-black trees
 sbvtree.h 2010-09-28 mikael-salson [r5] Bug correction relative to red-black trees
 slidingWindow.cpp 2010-09-28 mikael-salson [r6] Bug correction relative to red-black trees
 test.cpp 2009-12-11 mikael-salson [r1] Initial version
 testMultiple.sh 2009-12-11 mikael-salson [r1] Initial version
 types.h 2009-12-11 mikael-salson [r1] Initial version
 utils.cpp 2009-12-11 mikael-salson [r1] Initial version
 utils.h 2009-12-11 mikael-salson [r1] Initial version

Read Me

Compile
----------
make 

Run
----------
The compilation generates three executables:
 * test: you can use it directly or through testMultiple.sh for random 
         insertions and deletions.
 * slidingWindow: index only a window of given length and slide it along the
                  text.
 * locate: index a file and locate the specified patterns using the index.

For removing object files you can use 'make clean'.
For removing object, precompiled header and excutable files you can use 
'make cleanall'


Papers
---------
The method implemented is described in the following papers:
 ------ Dynamic Sequence with Indels -----
 uses huffman shaped wavelet tree
 space: O(n H_0) time: O((log n) H_0)
 paper: V. M\"akinen, G. Navarro. 
        Dynamic Entropy-Compressed Sequences and Full-Text Indexes. 
        CPM 2006, Chapter 3.6 

        W. Gerlach. 
        Dynamic FM-Index for a collection of texts with application
        to space-efficient construction of the compressed suffix array.
        Master's thesis. Universit\"at Bielefeld, Germany.

 ------ Dynamic Suffix Array -------
 papers: M. Salson, T. Lecroq, M. L\'eonard, L. Mouchard. 
         Dynamic Burrows-Wheeler Transform.
         PSC 2008, pp. 13--25, 2008.
                        
         M. Salson, T. Lecroq, M. L\'eonard, L. Mouchard.
         A Four-Stage Algorithm for Updating a Burrows-Wheeler Transform
         Theoretical Computer Science, 410(43):4350–4359, 2009.
                                        
         M. Salson, T. Lecroq, M. L\'eonard, L. Mouchard. 
         Dynamic Extended Suffix Arrays. 
         Journal of Discrete Algorithms. doi:10.1016/j.jda.2009.02.007
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.