The beltway problem over orthogonal groups
From MaRDI portal
Recommendations
Cites work
- A counterexample to a theorem of S. Piccard
- A partial digest approach to restriction site mapping
- Algebraic Theory of Phase Retrieval
- Benchmark problems for phase retrieval
- Bispectrum Inversion With Application to Multireference Alignment
- Estimation under group actions: recovering orbits from invariants
- Finite alphabet phase retrieval
- scientific article; zbMATH DE number 3824308 (Why is no real title available?)
- scientific article; zbMATH DE number 2209734 (Why is no real title available?)
- scientific article; zbMATH DE number 3036931 (Why is no real title available?)
- Mapping the genome
- Method of moments for 3D single particle \textit{ab initio} modeling with non-uniform distribution of viewing angles
- Reconstructing Point Sets From Distance Distributions
- String reconstruction from substring compositions
- The Complexity of Bit Retrieval
- The sample complexity of multireference alignment
- The sample complexity of sparse multi-reference alignment and single-particle cryo-electron microscopy
- There Are No Further Counterexamples to S. Piccard's Theorem
- Toward a mathematical theory of the crystallographic phase retrieval problem
- WHICH POINT CONFIGURATIONS ARE DETERMINED BY THE DISTRIBUTION OF THEIR PAIRWISE DISTANCES?
This page was built for publication: The beltway problem over orthogonal groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652585)