A bit-string longest-common-subsequence algorithm

DOI10.1016/0020-0190(86)90091-8zbMATH Open1455.68290DBLPjournals/ipl/AllisonD86OpenAlexW1994790623WikidataQ62654309 ScholiaQ62654309MaRDI QIDQ1996891FDOQ1996891

Authors: Lloyd Allison, Trevor I. Dix 

Publication date: 27 February 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90091-8

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• The String-to-String Correction Problem
• The theory and computation of evolutionary distances: Pattern recognition
• A fast algorithm for computing longest common subsequences
• Bounds for the String Editing Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Theory and Computation of Evolutionary Distances
• Algorithms for the Longest Common Subsequence Problem
• Bounds on the Complexity of the Longest Common Subsequence Problem
• General methods of sequence comparison
• A longest common subsequence algorithm suitable for similar text strings

Cited In (8)

• Tighter connections between Formula-SAT and shaving logs
• A substring-substring LCS data structure
• Linear-space S-table algorithms for the longest common subsequence problem
• LCS\(k\): a refined similarity measure
• Mining Bit-Parallel LCS-length Algorithms
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• An efficient algorithm for LCS problem between two arbitrary sequences
• From senses to texts: an all-in-one graph-based approach for measuring semantic similarity

This page was built for publication: A bit-string longest-common-subsequence algorithm

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