The following pages link to (Q5053318):
Displaying 6 items.
- Fast and optimal sequence-to-graph alignment guided by seeds (Q2170166) (← links)
- Vertex nomination via seeded graph matching (Q4970326) (← links)
- Seeded graph matching via large neighborhood statistics (Q5136925) (← links)
- Exact matching of random graphs with constant correlation (Q6041769) (← links)
- Statistical limits for testing correlation of random hypergraphs (Q6564542) (← links)
- A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs (Q6641062) (← links)