Combinatorial search
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Reconstructing a Hamiltonian cycle by querying the graph: application to DNA physical mapping
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
An optimal procedure for gap closing in whole genome shotgun sequencing
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Optimal Reconstruction of Graphs Under the Additive Model
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Gene Expression and Fast Construction of Distributed Evolutionary Representation
Evolutionary Computation
Linkage Problem, Distribution Estimation, and Bayesian Networks
Evolutionary Computation
Efficient Linkage Discovery by Limited Probing
Evolutionary Computation
The Journal of Machine Learning Research
Fda -a scalable evolutionary algorithm for the optimization of additively decomposed functions
Evolutionary Computation
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Lower and upper bounds for linkage discovery
IEEE Transactions on Evolutionary Computation
Efficient linkage discovery by limited probing
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Combinatorial search on graphs motivated by bioinformatics applications: a brief survey
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Properties of Symmetric Fitness Functions
IEEE Transactions on Evolutionary Computation
Optimal query complexity bounds for finding graphs
Artificial Intelligence
Reconstructing weighted graphs with minimal query complexity
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Optimally reconstructing weighted graphs using queries
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Toward a deterministic polynomial time algorithm with optimal additive query complexity
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Reconstructing weighted graphs with minimal query complexity
Theoretical Computer Science
Topology discovery of sparse random graphs with few participants
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Topology discovery of sparse random graphs with few participants
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Theoretical Computer Science
On parity check (0, 1)-matrix over Zp
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Random Structures & Algorithms
Graph reconstruction via distance oracles
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of vertices while a cross-additive query asks the number of edges crossing between two disjoint sets of vertices. The queries ask sum of weights for the weighted graphs. These types of queries were partially motivated in DNA shotgun sequencing and linkage discovery problem of artificial intelligence. For a given unknown weighted graph G with n vertices, m edges, and a certain mild condition on weights, we prove that there exists a non-adaptive algorithm to find the edges of G using O(m log n / log m) queries of both types provided that m ≥ nε for any constant ε 0. For an unweighted graph, it is shown that the same bound holds for all range of m. This settles a conjecture of Grebinski [23] for finding an unweighted graph using additive queries. We also consider the problem of finding the Fourier coefficients of a certain class of pseudo-Boolean functions. A similar coin weighing problem is also considered.