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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 465-476

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

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; POLYNOMIAL APPROXIMATION;

COMPUTATIONAL BIOLOGY; GUARANTEED CONVERGENCE; ITS APPLICATIONS; PHYSICAL MAPPING; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; RADIATION HYBRIDS; SYMMETRIC MATRICES;

MAPPING;

EID: 84896769555     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_39     Document Type: Conference Paper

References (13)

1. Richa Agarwala, Vineet Bafna, Martin Farach, Babu Narayanan, Mike Paterson, and Mikkel Thorup. On the approximability of numerical taxonomy (fitting distances by tree metrics). In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 365-372, 1996.
2. Amir Ben-Dor and Benny Chor. On constructing radiation hybrid maps. In Proceedings of the First International Conference on Computational Molecular Biology, pages 17-26, 1997.
3. D. Timothy Bishop and Gillian P. Crockford. Comparison of radiation hybrid mapping and linkage mapping. Cytogenet Cell Genet, 59: 93-95, 1992.
4. 3/14)-coloring algorithm for 3-colorable graphs. Information Processing Letters, 61(1): 49-53, 1997.
5. Andreas W. M. Dress and Timothy F. Havel. Bound smoothing under chirality constraints. SIAM J. Disc. Math., 4: 535-549, 1991.
6. Martin Farach and Sampath Kannan. Efficient algorithms for inverting evolution. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pages 230-236, 1996.
7. Martin Farach, Sampath Kannan, and Tandy Warnow. A robust model for finding optimal evolutionary trees (extended abstract). In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pages 137-145, 1993.
8. Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301): 13-30, March 1963.
9. Sanjeev Khanna, Nathan Linial, and Shmuel Safra. On the hardness of approximating the chromatic number. In ISTCS93, 1993.
10. Kenneth Lange, Michael Boehnke, David R. Cox, and Kathryn L. Lunetta. Statistical methods for polyploid radiation hybrid mapping. Genome Research, 5: 136-150, 1995.
11. James B. Saxe. Embeddability of graphs in k-space is strongly NP-hard. In 17th Allerton Conference in Communication, Control, and Computing, pages 480-489, 1979.
12. Thomas J. Schaefer. The complexity of satisfiability problems. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, pages 216-226, 1978.
13. Donna Slonim, Leonid Kruglyak, Lincoln Stein, and Eric Lander. Building human genome maps with radiation hybrids. In Proceedings of the First International Conference on Computational Molecular Biology, pages 277-286, 1997.