An \(O(n\log n)\) algorithm for finding dissimilar strings

DOI10.1016/S0020-0190(97)00057-4zbMath1337.68302MaRDI QIDQ290231

Sarmad Abbasi, Anirvan M. Sengupta

Publication date: 1 June 2016

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

zbMATH Keywords

combinatorial problemsanalysis of algorithmsprobabilistic methodLovász local lemmacomputational molecular biology

Mathematics Subject Classification ID

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

Related Items

Alphabet indexing for approximating features of symbols

Cites Work

• Unnamed Item
• Unnamed Item
• Graph-theoretic parameters concerning domination, independence, and irredundance
• An algorithmic approach to the Lovász local lemma. I
• Mapping the genome