An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score

DOI10.1137/S0097539794262677zbMath0855.68021OpenAlexW1993595044MaRDI QIDQ4887021

Sampath Kannan, Eugene W. Myers

Publication date: 15 October 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794262677

zbMATH Keywords

efficient algorithmssequence alignmentdivide-and-conquer techniques

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Data structures (68P05) Mathematical biology in general (92B99)

Related Items (5)

Sequence Alignment Algorithms for Run-Length-Encoded Strings ⋮ Efficient all path score computations on grid graphs ⋮ On almost Monge all scores matrices ⋮ Sparse LCS common substring alignment ⋮ Approximate periodicity

This page was built for publication: An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score