scientific article

zbMATH Open0966.68606MaRDI QIDQ2721998

Claus Rick

Publication date: 11 July 2001

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items (7)

Finding least-weight subsequences with fewer processors ⋮ RNA multiple structural alignment with longest common subsequences ⋮ Efficient algorithms for the longest common subsequence problem with sequential substring constraints ⋮ The colored longest common prefix array computed via sequential scans ⋮ Title not available (Why is that?) ⋮ Efficient algorithms for the longest common subsequence in \(k\)-length substrings ⋮ A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721998)