Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686MaRDI QIDQ5897540zbMATH OpenFDO

Authors Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11604686

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10)

Recommendations

• Applications of graph theory in DNA sequencing by hybridization
• scientific article; zbMATH DE number 5262869
• Statistical and Combinatorial Aspects of Comparative Genomics*
• Selected combinatorial problems of computational biology
• New problems of graph reconstruction

Cited in

(20)

• Nonadaptive algorithms for threshold group testing
• Non-adaptive learning of a hidden hypergraph
• Reconstructing weighted graphs with minimal query complexity
• Exact learning from an honest teacher that answers membership queries
• Applications of graph theory in DNA sequencing by hybridization
• Non-adaptive learning of a hidden hypergraph
• Linear Time Constructions of Some d-Restriction Problems
• Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Reconstructing weighted graphs with minimal query complexity
• Learning a hidden graph
• Error-tolerant non-adaptive learning of a hidden hypergraph
• On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
• Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
• Learning a hidden uniform hypergraph
• On learning graphs with edge-detecting queries
• Reconstruction of hidden graphs and threshold group testing
• Toward a deterministic polynomial time algorithm with optimal additive query complexity
• Reconstructing Markov processes from independent and anonymous experiments
• Optimal query complexity bounds for finding graphs

This page was built for publication: Graph-Theoretic Concepts in Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897540)