A fast algorithm for all-pairs Hamming distances

DOI10.1016/J.IPL.2018.07.006MaRDI QIDQ1799573zbMATH OpenOpenAlexWikidataFDO

Authors 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

clusteringdistance matrixHamming distancematrix multiplication

Mathematics Subject Classification ID

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

Cites work

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

Describes a project that uses

Uses Software

• OpenCourseWare

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799573)