An algorithm for a merge recognition problem

DOI10.1016/0166-218X(82)90039-7MaRDI QIDQ1170031zbMATH OpenFDO

Authors Anthony Mansfield

Publication date 1982

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(6)

• String shuffle: circuits and graphs
• Reconstructing a history of recombinations from a set of sequences
• On the computational complexity of a merge recognition problem
• A constant time string shuffle algorithm on reconfigurable meshes
• Unshuffling a square is NP-hard
• The Shuffle Product: New Research Directions

This page was built for publication: An algorithm for a merge recognition problem

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