Enumerating Neighbour and Closest Strings
From MaRDI portal
Publication:4899258
DOI10.1007/978-3-642-33293-7_24zbMATH Open1374.68248OpenAlexW61744817MaRDI QIDQ4899258FDOQ4899258
Authors: N. Nishimura, Narges Simjour
Publication date: 7 January 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_24
Recommendations
- scientific article; zbMATH DE number 3974323
- String indexing for top-\(k\) close consecutive occurrences
- On the closest string via rank distance
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- On the closest string and substring problems
- A recursive exact algorithm for the closest string problem
- A closer look at the closest string and closest substring problem
- scientific article; zbMATH DE number 2081011
- Exact algorithm and heuristic for the closest string problem
- Finding approximate patterns in strings
Cited In (6)
- Designing and implementing algorithms for the closest string problem
- Designing and Implementing Algorithms for the Closest String Problem
- The Editor's Corner: Strings, Substrings, and the `Nearest Integer' Function
- String indexing for top-\(k\) close consecutive occurrences
- Title not available (Why is that?)
- Combinatorial \(n\)-fold integer programming and applications
This page was built for publication: Enumerating Neighbour and Closest Strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899258)