Work

Efficient parallel string comparison

Year: 2008

Type: book-chapter

Abstract: The longest common subsequence (LCS) problem is a classical method of string comparison. Several coarse-grained parallel algorithms for the LCS problem have been proposed in the past. However. none of these algorithms achieve scalable communication. In this paper. we propose the first coarse-grained parallel LCS algorithm with scalable communication. Moreover, the algorithm is work-optimal, synchronisation-efficient, and solves a more general problem of semi-local string comparison, improving in at least two of these aspects on each of the predecessors.

Source: Warwick Research Archive Portal (University of Warwick)

DOI: 10.82444/warw.33535921

Authors: Peter Krusche, Alexander Tiskin

Language: English

Topic: Algorithms and Data Compression

Subfield: Theoretical Computer Science

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1864806550

FWCI: 4.933

Cites: 15

Cited by: 8

Related to: 10