Recognition of overlap graphs

DOI10.1007/s10878-013-9663-3zbMath1298.90120OpenAlexW2014419530MaRDI QIDQ405660

Leonidas S. Pitsoulis, Theodoros P. Gevezes

Publication date: 5 September 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9663-3

zbMATH Keywords

stringsrecognition algorithmshortest superstring problemoverlap graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

On the readability of overlap digraphs ⋮ On the Readability of Overlap Digraphs ⋮ Bipartite graphs of small readability

Cites Work

• Unnamed Item
• Unnamed Item
• A greedy approximation algorithm for constructing shortest common superstrings
• An algorithm for the detection and construction of Monge sequences
• Shortest common superstrings and scheduling with coordinated starting times
• On finding minimal length superstrings
• An efficient algorithm for the all pairs suffix-prefix problem
• Faster implementation of a shortest superstring approximation
• Approximating shortest superstrings with constraints
• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
• Sequential and Parallel Approximation of Shortest Superstrings
• On Transportation Problems with Upper Bounds on Leading Rectangles
• The greedy travelling salesman's problem
• Data compression via textual substitution
• Linear approximation of shortest superstrings
• Viral Genome Compression
• An Algorithm for Reconstructing Protein and RNA Sequences

This page was built for publication: Recognition of overlap graphs