An efficient algorithm for generating super condensed neighborhoods

DOI10.1007/11496656_10MaRDI QIDQ5713532zbMATH OpenOpenAlexFDO

Authors Arlindo L. Oliveira, Luís Manuel Silveira Russo

Publication date 14 December 2005

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

Full work available at URL https://doi.org/10.1007/b137128

Mathematics Subject Classification ID

Combinatorics on words (68R15) Approximation algorithms (68W25)

Recommendations

• Efficient generation of super condensed neighborhoods
• Notes on generating completely condensed d-neighborhoods
• A linear-time algorithm for finding approximate shortest common superstrings
• Shift-or string matching with super-alphabets
• A new indexing method for approximate string matching

Cited in

(4)

• Algorithms for the optimal identification of segment neighborhoods
• Efficient generation of super condensed neighborhoods
• Notes on generating completely condensed d-neighborhoods
• Faster neighbour list generation using a novel lattice vector representation

This page was built for publication: An efficient algorithm for generating super condensed neighborhoods

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