Construction of Fundamental Data Structures for Strings
eBook
$59.99
Collect stamps to save with Rewards. 10 stamps = $5. Learn More
Select a store to view item availability.
Available on compatible , the free NOOK App, and in My Digital Library
NOOK App
Download NOOK app
NOOK Devices
NOOK eReaders
- NOOK GlowLight 4 Plus
- NOOK GlowLight 4e
- NOOK GlowLight 4
- NOOK GlowLight Plus 7.8"
- NOOK GlowLight 3
- NOOK GlowLight Plus 6"
NOOK Tablets
- NOOK 9" Lenovo Tablet
- NOOK 10" HD Lenovo Tablet
- NOOK Tablet 7" & 10.1"
- NOOK by Samsung Galaxy Tab 7.0 [Tab A and Tab 4]
- NOOK by Samsung [Tab 4 10.1, S2 & E]
Free NOOK Reading Apps
- NOOK for iOS
- NOOK for Android
BN.com website
Go to your Digital Library in My Account
Limit 1 per customer
This books reviews recent theoretical and practical advances on suffix sorting and introduces algorithmic solutions to problems of wide interest for the construction of fundamental data structures that operate efficiently on strings namely, constructing the suffix array, the longest common prefix (LCP) array, the document array and the Lyndon array.
These data structures are the cornerstone of many algorithmic solutions in Bioiformatics, Information Retrieval and Data Compression.
This book...
These data structures are the cornerstone of many algorithmic solutions in Bioiformatics, Information Retrieval and Data Compression.
This book...























