The isomap algorithm in distance geometry

DOI10.4230/LIPICS.SEA.2017.5zbMATH Open1432.68521MaRDI QIDQ4580147FDOQ4580147

Authors: Leo Liberti, Claudia D'Ambrosio 

Publication date: 13 August 2018

Recommendations

• New methods for the distance geometry problem
• Diagonally dominant programming in distance geometry
• Distance geometry and data science
• Euclidean distance geometry and applications
• Realizing Euclidean distance matrices by sphere intersection

zbMATH Keywords

heuristicsprotein conformationdistance geometry problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (7)

• Diagonally dominant programming in distance geometry
• Low-dimensional embedding with extra information
• Distance geometry and data science
• Nonlinear mapping and distance geometry
• A comment on ``Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding
• An algorithm for realizing Euclidean distance matrices
• Low-dimensional embedding with extra information

This page was built for publication: The isomap algorithm in distance geometry

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