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

DOI10.1016/J.DAM.2005.07.014zbMATH Open1087.92050OpenAlexW1973450785MaRDI QIDQ2489943FDOQ2489943

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

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

zbMATH Keywords

randomized algorithmlocation problemrandom paths

Mathematics Subject Classification ID

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

Cites Work

• Fitting points on the real line and its application to RH mapping
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probe location in the presence of errors: A problem from DNA mapping
• Point placement on the line by distance data.
• Placing Probes along the Genome Using Pairwise Distance Data

Cited In (4)

• Three paths to point placement
• Competitive query strategies for minimising the ply of the potential locations of moving points
• Point placement on the line by distance data.
• More on generalized jewels and the point placement problem

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)