Randomized vs. deterministic distance query strategies for point location on the line

DOI10.1016/J.DAM.2005.07.014MaRDI QIDQ2489943zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 28 April 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.07.014

zbMATH Keywords

location problemrandom pathsrandomized algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (05C99) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Recommendations

• Point placement on the line by distance data.
• Three paths to point placement
• scientific article; zbMATH DE number 1629847
• How to play hot and cold on a line
• Selecting distances in the plane

Cites work

• Fitting points on the real line and its application to RH mapping
• scientific article; zbMATH DE number 1617274 (Why is no real title available?)
• scientific article; zbMATH DE number 1629847 (Why is no real title available?)
• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• scientific article; zbMATH DE number 2209734 (Why is no real title available?)
• Placing Probes along the Genome Using Pairwise Distance Data
• Point placement on the line by distance data.
• Probe location in the presence of errors: A problem from DNA mapping

Cited in

(5)

• Point placement on the line by distance data.
• Competitive query strategies for minimising the ply of the potential locations of moving points
• Three paths to point placement
• More on generalized jewels and the point placement problem
• Anonymous self-stabilising localisation via spatial population protocols

This page was built for publication: Randomized vs. deterministic distance query strategies for point location on the line

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