On the public citation graph
Interval graphs and maps of DNA
0 signed · 91 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0022-2836(73)90122-8openalex-snapshot
Studies of Simian virus 40 DNA
inferredcites →https://doi.org/10.1016/0303-2647(82)90010-7openalex-snapshot
Computer-assisted sequencing, interval graphs, and molecular evolution
inferredcites →https://doi.org/10.1016/0378-1119(83)90060-4openalex-snapshot
Mapping the order of DNA restriction fragments
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1073/pnas.45.11.1607openalex-snapshot
ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11160-5openalex-snapshot
Incidence matrices with the consecutive 1’s property
inferredcites →https://doi.org/10.4064/fm-51-1-45-64openalex-snapshot
Representation of a finite graph by a set of intervals on the real line
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-snapshot
A Characterization of Comparability Graphs and of Interval Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/aama.1994.1009openalex-snapshot
On the Complexity of DNA Physical Mapping
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_365openalex-snapshot
Optimization in Leveled Graphs
inferred← citeshttps://doi.org/10.1007/11618058_39openalex-snapshot
Proper and Planar Drawings of Graphs on Three Layers
inferred← citeshttps://doi.org/10.1007/11809678_48openalex-snapshot
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_41openalex-snapshot
On the Parameterized Complexity of Layered Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_33openalex-snapshot
The Enhanced Double Digest Problem for DNA Physical Mapping
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_1openalex-snapshot
A Fixed-Parameter Approach to Two-Layer Planarization
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_29openalex-snapshot
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_57openalex-snapshot
An alternative method to crossing minimization on hierarchical graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_483openalex-snapshot
Optimization in Leveled Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4684-6381-1_1openalex-snapshot
Applications of Combinatorics and Graph Theory to the Biological and Social Sciences: Seven Fundamental Ideas
inferred← citeshttps://doi.org/10.1007/978-1-4684-6381-1_15openalex-snapshot
Some Mathematics for DNA Restriction Mapping
inferred← citeshttps://doi.org/10.1007/978-3-030-68211-8_12openalex-snapshot
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_32openalex-snapshot
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_27openalex-snapshot
Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_6openalex-snapshot
Approximating the Maximum Sharing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_9openalex-snapshot
Upward Drawings of Trees on the Minimum Number of Layers
inferred← citeshttps://doi.org/10.1007/978-3-642-12165-4_25openalex-snapshot
Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_39openalex-snapshot
Two-Layer Planarization Parameterized by Feedback Edge Set
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_30openalex-snapshot
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number
inferred← citeshttps://doi.org/10.1007/978-3-642-50124-1_2openalex-snapshot
Genomes, Maps and Sequences
inferred← citeshttps://doi.org/10.1007/bf01188582openalex-snapshot
DNA physical mapping and alternating Eulerian cycles in colored graphs
inferred← citeshttps://doi.org/10.1007/bfb0058021openalex-snapshot
Graph editing to bipartite interval graphs: Exact and asymptotic bounds
inferred← citeshttps://doi.org/10.1007/s00453-004-1093-2openalex-snapshot
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
inferred← citeshttps://doi.org/10.1007/s00453-005-1181-yopenalex-snapshot
A Fixed-Parameter Approach to 2-Layer Planarization
inferred← citeshttps://doi.org/10.1007/s00453-007-9151-1openalex-snapshot
On the Parameterized Complexity of Layered Graph Drawing
inferred← citeshttps://doi.org/10.1007/s00453-018-0410-0openalex-snapshot
Canonical Representations for Circular-Arc Graphs Using Flip Sets
inferred← citeshttps://doi.org/10.1016/0196-8858(87)90013-3openalex-snapshot
Mapping DNA by stochastic relaxation
inferred← citeshttps://doi.org/10.1016/0196-8858(91)90028-hopenalex-snapshot
Multiple solutions of DNA restriction mapping problems
inferred← citeshttps://doi.org/10.1016/0378-1119(96)00123-0openalex-snapshot
A general method for fast multiple sequence alignment
inferred← citeshttps://doi.org/10.1016/0888-7543(90)90293-4openalex-snapshot
Optimizing restriction fragment fingerprinting methods for ordering large genomic libraries
inferred← citeshttps://doi.org/10.1016/0895-7177(92)90166-iopenalex-snapshot
A bibliography on computational molecular biology and genetics
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50041-5openalex-snapshot
10.1016/b978-044488002-4/50041-5
inferred← citeshttps://doi.org/10.1016/j.aml.2010.11.030openalex-snapshot
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2005.07.002openalex-snapshot
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
inferred← citeshttps://doi.org/10.1016/j.dam.2006.10.016openalex-snapshot
Tree-edges deletion problems with bounded diameter obstruction sets
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.022openalex-snapshot
Improper Colourings of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.030openalex-snapshot
Some approximation algorithms for the clique partition problem in weighted interval graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.009openalex-snapshot
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.029openalex-snapshot
Two-Layer Planarization parameterized by feedback edge set
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.023openalex-snapshot
Convex and isometric domination of (weak) dominating pair graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00204-1openalex-snapshot
Representing graphs by disks and balls (a survey of recognition-complexity results)
inferred← citeshttps://doi.org/10.1016/s0020-0255(00)00048-7openalex-snapshot
On the complexity of the maximum biplanar subgraph problem
inferred← citeshttps://doi.org/10.1023/a:1021946523069openalex-snapshot
The Enhanced Double Digest Problem for DNA Physical Mapping
inferred← citeshttps://doi.org/10.1089/cmb.1994.1.227openalex-snapshot
A Subgraph Problem from Restriction Maps of DNA
inferred← citeshttps://doi.org/10.1089/cmb.1994.1.241openalex-snapshot
Equivalence Classes for the Double-Digest Problem with Coincident Cut Sites
inferred← citeshttps://doi.org/10.1089/cmb.1995.2.139openalex-snapshot
Four Strikes Against Physical Mapping of DNA
inferred← citeshttps://doi.org/10.1089/cmb.2009.0039openalex-snapshot
On the Maximal Interval Subgraph of a Tree
inferred← citeshttps://doi.org/10.1089/cmb.2016.0046openalex-snapshot
A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n 2 Pairwise Distances in n 2 Steps for the Sequencing Problem: II. Algorithm
inferred← citeshttps://doi.org/10.1093/bioinformatics/13.5.523openalex-snapshot
FPC: a system for building contigs from restriction fingerprinted clones
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.suppl_1.s262openalex-snapshot
Probabilistic approaches to the use of higher order clone relationships in physical map assembly
inferred← citeshttps://doi.org/10.1109/51.265797openalex-snapshot
Engineering in genomics/spl minus/combinatorial methods for DNA physical mapping
inferred← citeshttps://doi.org/10.1109/hicss.1993.270687openalex-snapshot
Dynamic methods for fragment assembly in large scale genome sequencing projects
inferred← citeshttps://doi.org/10.1109/iccad.2005.1560130openalex-snapshot
Eliminating wire crossings for molecular quantum-dot cellular automata implementation
inferred← citeshttps://doi.org/10.1109/istcs.1995.377035openalex-snapshot
Open combinatorial problems in computational molecular biology
inferred← citeshttps://doi.org/10.1109/tcad.2007.906467openalex-snapshot
Fabricatable Interconnect and Molecular QCA Circuits
inferred← citeshttps://doi.org/10.1137/1.9781611972801.31openalex-snapshot
Consecutive ones property and spectral ordering
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch77openalex-snapshot
Linear Recognition of Almost Interval Graphs
inferred← citeshttps://doi.org/10.1137/s1052623498334013openalex-snapshot
An Alternative Method to Crossing Minimization on Hierarchical Graphs
inferred← citeshttps://doi.org/10.1142/9789812799890_0008openalex-snapshot
SOME APPLICATIONS OF GRAPH THEORY
inferred← citeshttps://doi.org/10.1142/s0218195904001433openalex-snapshot
PATHWIDTH AND LAYERED DRAWINGS OF TREES
inferred← citeshttps://doi.org/10.1145/267521.267552openalex-snapshot
Towards constructing physical maps by optical mapping (extended abstract)
inferred← citeshttps://doi.org/10.1162/evco.1994.2.4.321openalex-snapshot
Multiniche Crowding in Genetic Algorithms and Its Application to the Assembly of DNA Restriction-Fragments
inferred← citeshttps://doi.org/10.1186/1471-2105-11-584openalex-snapshot
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
inferred← citeshttps://doi.org/10.1186/s12859-019-2862-xopenalex-snapshot
DDmap: a MATLAB package for the double digest problem using multiple genetic operators
inferred← citeshttps://doi.org/10.14704/nq.2014.12.3.738openalex-snapshot
Extensive Quantum Theory of DNA and Biological String
inferred← citeshttps://doi.org/10.1504/ijbra.2009.028684openalex-snapshot
The Double Digest Problem: finding all solutions
inferred← citeshttps://doi.org/10.15488/3569openalex-snapshot
Computational complexity aspects of implicit graph representations
inferred← citeshttps://doi.org/10.2298/aadm161005024bopenalex-snapshot
Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
inferred← citeshttps://doi.org/10.3109/10425179109020776openalex-snapshot
Mapping DNA by stochastic relaxation: schedule for optimal annealing
inferred← citeshttps://doi.org/10.48550/arxiv.2007.03859openalex-snapshot
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0102010openalex-snapshot
The Enhanced Double Digest Problem for DNA Physical Mapping
inferred← citeshttps://doi.org/10.7155/jgaa.00206openalex-snapshot
Minimum-Layer Upward Drawings of Trees
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.