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)

Full work available at URL https://doi.org/10.1016/0166-218X(82)90039-7

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

(8)

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

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)