A fast algorithm for all-pairs Hamming distances

DOI10.1016/j.ipl.2018.07.006zbMath1478.68456OpenAlexW2884200747WikidataQ129493355 ScholiaQ129493355MaRDI QIDQ1799573

Abdullah N. Arslan

Publication date: 19 October 2018

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.07.006

zbMATH Keywords

clusteringHamming distancedistance matrixmatrix multiplication

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms (68W40) Algorithms on strings (68W32)

Uses Software

• OpenCourseWare

Cites Work

• Matrix multiplication via arithmetic progressions
• Gaussian elimination is not optimal
• Powers of tensors and fast matrix multiplication
• On the complexity of matrix product
• Biological Sequence Analysis

This page was built for publication: A fast algorithm for all-pairs Hamming distances