Fitting points on the real line and its application to RH mapping

Journal of Algorithms

Volumn 49, Issue 1, 2003, Pages 42-62

  Håstad, Johan ^a   Ivansson, Lars ^a   Lagergren, Jens ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Approximation; Line fitting; Lower bounds; RH mapping

Indexed keywords

APPROXIMATION THEORY; BIOLOGY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; DNA SEQUENCES; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

COMPUTATIONAL BIOLOGY; GRAPH COLORING; LINE FITTING; LOWER BOUNDS; RADIATION HYBRID MAPPING;

ALGORITHMS;

EID: 10744229030     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00083-X     Document Type: Article

References (14)

1. R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson, M. Thorup, On the approximability of numerical taxonomy (fitting distances by tree metrics), in: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 365-372.
2. A. Ben-Dor, B. Chor, On constructing radiation hybrid maps, in: Proceedings of the First International Conference on Computational Molecular Biology, 1997, pp. 17-26.
3. D. Timothy Bishop, Gillian P. Crockford, Comparison of radiation hybrid mapping and linkage mapping, Cyt. Cell Genet. 59, (1992) 93-95.
4. 3/14)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett. 61 (1) (1997) 49-53.
5. A.W.M. Dress, T.F. Havel, Bound smoothing under chirality constraints, SIAM J. Discrete Math. (1991) 535-549.
6. M. Farach, S. Kannan, Efficient algorithms for inverting evolution, in: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 1996, pp. 230-236.
7. M. Farach, S. Kannan, T. Warnow, A robust model for finding optimal evolutionary trees (extended abstract). in: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993, pp. 137-145.
8. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58 (301) (1963) 13-30.
9. S. Khanna, N. Linial, S. Safra, On the hardness of approximating the chromatic number, in: Proceedings of the 2nd Israel Symposium on Theory and Computing Systems, ISTCS, IEEE Computer Society Press, 1993, pp. 250-260.
10. K. Lange, M. Boehnke, D.R. Cox, K.L. Lunetta, Statistical methods for polyploid radiation hybrid mapping, Genome Res. 5 (1995) 136-150.
11. N. Linial, E. London, Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15 (1995) 215-245.
12. J.B. Saxe, Embeddability of graphs in k-space is strongly NP-hard, in: 17th Allerton Conference in Communication, Control, and Computing, 1979, pp. 480-489.
13. T.J. Schaefer, The complexity of satisfiability problems, in: Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, 1978, pp. 216-226.
14. D. Slonim, L. Kruglyak, L. Stein, E. Lander, Building human genome maps with radiation hybrids, in: Proceedings of the First International Conference on Computational Molecular Biology, 1997, pp. 277-286.