An O(n n) algorithm for finding dissimilar strings

DOI10.1016/S0020-0190(97)00057-4MaRDI QIDQ290231zbMATH OpenFDO

Authors Sarmad Abbasi, Anirvan Sengupta

Publication date 1 June 2016

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

zbMATH Keywords

analysis of algorithmscombinatorial problemsprobabilistic methodcomputational molecular biologyLovász local lemma

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Analysis of algorithms (68W40) Algorithms on strings (68W32)

Recommendations

• A new algorithm for the characteristic string problem under loose similarity criteria
• Fast string matching with k differences
• scientific article; zbMATH DE number 1445379
• A fast longest common subsequence algorithm for similar strings
• Publication:4733401

Cites work

• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• An algorithmic approach to the Lovász local lemma. I
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Mapping the genome

Cited in

(1)

• Alphabet indexing for approximating features of symbols

This page was built for publication: An \(O(n\log n)\) algorithm for finding dissimilar strings

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