CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
The point placement problem on a line improved bounds for pairwise distance queries
Authors
BH Hosten
DD Palmer
+4 more
DK Rehbein
EP Papadakis
GH Thomas
TA Gray
Publication date
1 January 1988
Publisher
Germany
Doi
Cite
Abstract
This research is supported by the RGC grant HKU7119/05E.In this paper, we study the adaptive version of the point placement problem on a line, which is motivated by a DNA mapping problem. To identify the relative positions of n distinct points on a straight line, we are allowed to ask queries of pairwise distances of the points in rounds. The problem is to find the number of queries required to determine a unique solution for the positions of the points up to translation and reflection. We improved the bounds for several cases. We show that An/3 + O(√n) queries are sufficient for the case of two rounds while the best known result was 3n/2 queries. For unlimited number of rounds, the best result was 4n/3 queries. We obtain a much better result of using 5n/4 + O(√n) queries with three rounds only. We also improved the lower bound of 30n/29 to 17n/16 for the case of two rounds. © Springer-Verlag Berlin Heidelberg 2007.link_to_subscribed_fulltex
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
HKU Scholars Hub
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:hub.hku.hk:10722/93450
Last time updated on 01/06/2016
Digital Repository @ Iowa State University (ISU)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dr.lib.iastate.edu:20.500....
Last time updated on 11/01/2024
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2F978-1-4613-...
Last time updated on 01/04/2019