Efficient Alignment Free Sequence Comparison with Bounded Mismatches

DOI10.1007/978-3-319-16706-0_1zbMath1355.92028OpenAlexW296365942MaRDI QIDQ2814576

Alberto Apostolico, Sharma V. Thankachan, Srinivas Aluru

Publication date: 22 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-16706-0_1

zbMATH Keywords

Hamming distanceaverage common substringphotogenic reconstruction

Mathematics Subject Classification ID

Problems related to evolution (92D15) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis ⋮ Analysis of the Period Recovery Error Bound

This page was built for publication: Efficient Alignment Free Sequence Comparison with Bounded Mismatches