scientific article; zbMATH DE number 434723
From MaRDI portal
Publication:3139562
graphcombinatorial optimizationcomputational molecular biologyminimum cycle meanflows algorithmsKarzanov algorithmphysical maps refiningsmall-scale DNA physical mapping
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Biochemistry, molecular biology (92C40) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Paths and cycles (05C38) Software, source code, etc. for problems pertaining to biology (92-04)
Recommendations
- On the complexity of DNA physical mapping
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- scientific article; zbMATH DE number 437562
- Mapping clones with a given ordering or interleaving
Cited in
(5)- On the minimum number of topologies explaining a sample of DNA sequences
- On the complexity of DNA physical mapping
- scientific article; zbMATH DE number 1974594 (Why is no real title available?)
- ON FINDING TOPOLOGICALLY VALID MATCHINGS IN RESTRICTION-FRAGMENT MAPS
- DNA physical mapping and alternating Eulerian cycles in colored graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139562)
