A linear-time algorithm for the 1-mismatch problem
From MaRDI portal
Publication:5096932
DOI10.1007/3-540-63307-3_53zbMath1497.68606MaRDI QIDQ5096932
Ross C. Hardison, Webb Miller, Nikola Stojanović, Deborah Gumucio, Piotr Berman
Publication date: 19 August 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63307-3_53
Related Items
Closest substring problems for regular languages, Randomized fixed-parameter algorithms for the closest string problem, Configurations and minority in the string consensus problem, A three-string approach to the closest string problem, Parameterized complexity analysis for the closest string with wildcards problem, Efficient algorithms for consensus string problems minimizing both distance sum and radius, Consensus string problem for multiple regular languages, Combinatorial \(n\)-fold integer programming and applications
Cites Work