NDLI: Fast Parallel Computation of Longest Common Prefixes

Content Provider	IEEE Xplore Digital Library
Author	Shun, Julian
Copyright Year	2014
Abstract	Suffix arrays and the corresponding longest common prefix (LCP) array have wide applications in bioinformatics, information retrieval and data compression. In this work, we propose and theoretically analyze new parallel algorithms for computing the LCP array given the sux array as input. Most of our algorithms have a work and depth (parallel time) complexity related to the LCP values of the input. We also present a slight variation of Kärkkäinen and Sanders' skew algorithm that requires linear work and poly-logarithmic depth in the worst case. We present a comprehensive experimental study of our parallel algorithms along with existing parallel and sequential LCP algorithms. On a variety of real-world and artificial strings, we show that on a 40-core shared-memory machine our fastest algorithm is up to 2.3 times faster than the fastest existing parallel algorithm, and up to 21.8 times faster than the fastest sequential LCP algorithm.
Starting Page	387
Ending Page	398
File Size	341394
Page Count	12
File Format	PDF
ISSN	21674337
e-ISBN	9781479955008
DOI	10.1109/SC.2014.37
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-11-16
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Arrays Algorithm design and analysis Parallel algorithms Phased arrays Heuristic algorithms Radiation detectors Bioinformatics
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast parallel computation of longest common prefixes

Research on longest common subsequence fast algorithm

Computing all longest common subsequences on MPI cluster

A relative position based algorithm to find out the longest common subsequence from multiple biological sequences

An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem

A Parallel Algorithm of Frequent Itemsets Mining Based on Bit Matrix

Exemplar Longest Common Subsequence

Fast Parallel Computation of Longest Common Prefixes Julian

A PC Cluster Based Parallel Algorithm for Longest Common Subsequence Problems

Fast Parallel Computation of Longest Common Prefixes

Similar Documents

Fast parallel computation of longest common prefixes

Research on longest common subsequence fast algorithm

Computing all longest common subsequences on MPI cluster

A relative position based algorithm to find out the longest common subsequence from multiple biological sequences

An Efficient Parallel Algorithm for the Multiple Longest Common Subsequence (MLCS) Problem

A Parallel Algorithm of Frequent Itemsets Mining Based on Bit Matrix

Exemplar Longest Common Subsequence

Fast Parallel Computation of Longest Common Prefixes Julian

A PC Cluster Based Parallel Algorithm for Longest Common Subsequence Problems

Fast Parallel Computation of Longest Common Prefixes