✦ LIBER ✦

Scalable parallel suffix array construction

✍ Scribed by Fabian Kulla; Peter Sanders

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 358 KB
Volume: 33
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2007.06.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Parallel Suffix Tree Constructio

Optimal Parallel Suffix Tree Construction

✍ Ramesh Hariharan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 656 KB

An O(m)-work, O(m)-space, O(log 4 m)-time CREW-PRAM algorithm for constructing the suffix tree of a string s of length m drawn from any fixed alphabet set is obtained. This is the first known work and space optimal parallel algorithm for this problem. It can be generalized to a string s drawn from a

Parallel construction of minimal suffix

Parallel construction of minimal suffix and factor automata

✍ Maxime Crochemore; Wojciech Rytter 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 730 KB

Parallelizing the construction of indire

Parallelizing the construction of indirect access arrays for shared-memory machines

✍ Tuszyński, Jaroslaw ;Löhner, Rainald 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

A way has been found to form indirect addressing lists in parallel on shared-memory parallel machines. The maximum possible speed-up for typical tetrahedral grids is approximately 1 : 23. The algorithm requires an additional scratch array to shift from the serial `elements surrounding points' to the