An algorithm for a merge recognition problem
From MaRDI portal
Publication:1170031
DOI10.1016/0166-218X(82)90039-7zbMath0496.68027MaRDI QIDQ1170031
Publication date: 1982
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (6)
Unshuffling a square is NP-hard ⋮ On the computational complexity of a merge recognition problem ⋮ A constant time string shuffle algorithm on reconfigurable meshes ⋮ String shuffle: circuits and graphs ⋮ The Shuffle Product: New Research Directions ⋮ Reconstructing a history of recombinations from a set of sequences
Cites Work
This page was built for publication: An algorithm for a merge recognition problem