✦ LIBER ✦

A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem

✍ Scribed by Carlos E.R. Alves; Edson N. Caceres; Siang Wun Song

Publisher: Springer
Year: 2006
Tongue: English
Weight: 377 KB
Volume: 45
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-006-1216-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for the longest-common-

A fast algorithm for the longest-common-subsequence problem

✍ Amar Mukhopadhyay 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 696 KB

Time-Efficient Parallel Algorithms for t

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

✍ Jean-Frédéric Myoupo; David Semé 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

A fast and practical bit-vector algorith

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem

✍ Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzon; James F. Reid 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 269 KB

A New Efficient Algorithm for Computing

A New Efficient Algorithm for Computing the Longest Common Subsequence

✍ Costas S. Iliopoulos; M. Sohel Rahman 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 444 KB

Analysis of Evolutionary Algorithms for

Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem

✍ Thomas Jansen; Dennis Weyland 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 429 KB

A coarse-grained parallel QR-factorizati

A coarse-grained parallel QR-factorization algorithm for sparse least squares problems

✍ Tz. Ostromsky; P.C. Hansen; Z. Zlatev 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 599 KB

A sparse QR-factorization algorithm SPARQR for coarse-grained parallel computations is described. The coefficient matrix, which is assumed to be general sparse, is reordered in an attempt to bring as many zero elements in the lower left corner as possible. The reordered matrix is then partitioned in