Abstract
Suffix sorting is one of the most important tasks in string processing. In the past two decades more than 20 suffix sorting algorithms have been proposed. To date, the fastest alternatives to compute the suffix array are based on the induced sorting technique. In this chapter, we present a brief history of suffix sorting, we review important induced sorting algorithms, and we detail algorithms SAIS (Nong et al., 2011) and SACA-K (Nong, 2013), which are the basis of the algorithms introduced in Chaps. 4, 6, and 5.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
