On the space complexity of some algorithms for sequence comparison

DOI10.1016/0304-3975(92)90266-IzbMath0745.68060OpenAlexW2011450903WikidataQ127877777 ScholiaQ127877777MaRDI QIDQ1184980

Yuval Rabani, Zvi Galil

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90266-i

zbMATH Keywords

sequence comparisonmodified edit distance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (1)

Constrained sequence alignment

Cites Work

• Sequence comparison with concave weighting functions
• Speeding up dynamic programming with applications to molecular biology
• A linear space algorithm for computing maximal common subsequences

This page was built for publication: On the space complexity of some algorithms for sequence comparison