Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3970750 (Why is no real title available?)
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 53885 (Why is no real title available?)
- scientific article; zbMATH DE number 3532378 (Why is no real title available?)
- scientific article; zbMATH DE number 699389 (Why is no real title available?)
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- scientific article; zbMATH DE number 910893 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- Determination of a Subset from Certain Combinatorial Properties
- Determination of two vectors from the sum
- Kolmogorov complexity arguments in combinatorics
- On a Combinatorial Problem in Number Theory
- On a packing and covering problem
- On the difference between consecutive primes
- Optimal reconstruction of graphs under the additive model
Cited in
(32)- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- Reconstructing weighted graphs with minimal query complexity
- Nonadaptive algorithms for threshold group testing
- Learning a hidden uniform hypergraph
- Optimal query complexity bounds for finding graphs
- scientific article; zbMATH DE number 434723 (Why is no real title available?)
- Chinese remainder encoding for Hamiltonian cycles
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
- scientific article; zbMATH DE number 2013459 (Why is no real title available?)
- The Hamiltonian connectivity of rectangular supergrid graphs
- Reconstructing weighted graphs with minimal query complexity
- scientific article; zbMATH DE number 1342106 (Why is no real title available?)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- Network construction with subgraph connectivity constraints
- Reconstruction and verification of chordal graphs with a distance oracle
- Exact learning from an honest teacher that answers membership queries
- Error-tolerant non-adaptive learning of a hidden hypergraph
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Learning Boolean halfspaces with small weights from membership queries
- Hamiltonian cycles in linear-convex supergrid graphs
- Learning a hidden graph
- The Hamiltonian properties of supergrid graphs
- Toward a deterministic polynomial time algorithm with optimal additive query complexity
- Reconstructing Markov processes from independent and anonymous experiments
- Reconstruction of hidden graphs and threshold group testing
- Hidden Hamiltonian cycle recovery via linear programming
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Network construction with ordered constraints
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Developing a new approach for (biological) optimal control problems: application to optimization of laccase production with a comparison between response surface methodology and novel geometric procedure
- Non-adaptive learning of a hidden hypergraph
- Non-adaptive learning of a hidden hypergraph
This page was built for publication: Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281767)
