A new graph model and algorithms for consistent superstring problems

DOI10.1098/rsta.2013.0134zbMath1353.68317OpenAlexW2141006903WikidataQ37718323 ScholiaQ37718323MaRDI QIDQ2955630

Sukhyeun Cho, Siwon Choi, Jin Wook Kim, Joong Chae Na, Kun Soo Park, Jeong Seop Sim

Publication date: 13 January 2017

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rsta.2013.0134

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Shortest consistent superstrings computable in polynomial time
• On the complexity of learning strings and sequences
• A comparative analysis of several asymmetric traveling salesman problem formulations
• Finding the longest common nonsuperstring in linear time
• The vehicle routing problem: An overview of exact and approximate algorithms
• Approximating shortest superstrings with constraints
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Data compression via textual substitution
• Efficient string matching
• String Noninclusion Optimization Problems

This page was built for publication: A new graph model and algorithms for consistent superstring problems