Banishing bias from consensus sequences

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

Volumn 1264, Issue , 1997, Pages 248-261

  Ben Dor, Amir ^a   Lancia, Giuseppe ^b   Perone, Jennifer ^c   Ravi, R ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c NEW YORK UNIVERSITY SCHOOL OF MEDICINE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; PATTERN MATCHING; PROBES;

CONSENSUS SEQUENCE; DISEASE DETECTION; INTEGER PROGRAMMING FORMULATIONS; MULTIPLE ALIGNMENT; PERFORMANCE RATIO; RANDOMIZED ROUNDING; SEARCH PROCEDURES; SIMILARITY SCORES;

INTEGER PROGRAMMING;

EID: 84948988165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63220-4_63     Document Type: Conference Paper

References (26)

1. Stephen F. Altschul, Raymond J. Carroll, and David J. Lipman. Weights for Data Related by a Tree. Journal o] Molecular Biology, 207, 647-653, 1989.
2. A. Bairoch. PROSITE: A Dictionary of Sites and patterns in Proteins. Nucleic Acids Research, 20, 2019-2022, 1992.
3. A. Bairoch, and B. Boeckmann. The SWISSPROT Protein Sequence Data Bank. Nucleic Acids Research, 20, 2019-2022, 1992.
4. M.O. Dayhoff, W.C. Barker and L.T. Hunt. Establishing homologies in protein sequences. Methods Enzymol., 91:524-545, 1983.
5. R. Dular, R. Kajioka, and S. Kasatiya. Comparison of gene-probe commercial kit and culture technique for the diagnosis of myeoplasma pneumonia infection. J. of Clinical Microbiology, 26(5):1068-1069, May 1988.
6. S.R. Eddy, G. Mitchison, and R. Durbin. Maximum discrimination hidden Markov models of sequence consensus. J. of Computational Biology, 2:9-23. 1995.
7. M. Frances and A. Litman. On covering problems of codes. Technical Report 827, Technion, Israel, July 1994.
8. Program Manual for the Wisconsin Package, Version 8, September 1994, Genetics Computer Group, 575 Science Drive, Madison, Wisconsin, USA 53711.
9. M. Gribskov, A. D. McLachlan, and D. Eisenberg. Profile Analysis: Detection of Distantly Related Proteins. Proceedings of the National Academy of Science, U.S.A., 84, 4355-4358, 1987.
10. M. Gerstein, E. Sonnhammer, and C. Chothia. Volume Changes in protein evolution. J. Mol. Biol., 235:1067-1078, 1994.
11. Steven Henikoff and Jorja G. Henikoff. Position-based Sequence Weights. J. Mol. Biol., 243, 574-578, 1994.
12. W. Hoeffding. Probability inequalities for sums of bound random variables. J. Amer. Statist. Assoc., 58:13-30, 1963.
13. M. Ito, K. Shimizu, M. Nakanishi, and A. Hashimoto. Polynomial-time algorithms for computing characteristic strings. Proc. CPM 94, LNCS 807:274-288, 1994.
14. N. Karmarkar. A new polynomial time algorithm for linear programming, Combinatorica, 4:373-395, 1984.
15. A. Krogh, and G. Mitchison. Maximum entropy weighting of aligned sequences of protein or DNA, in Proc. Third Int. Conf. on Intelligent System for Mol. Biol., (C. Rawlings, D. Clark, R. Altman, L. Hunter, T. Lengauer, S. Wodak, eds.) pp. 215-221, AAAI Press, Menlo Park, CA, 1995.
16. R. Luthy, I. Xenarios, and P. Bicher. Improving the sensitivity of the sequence profile method, Protein Science, 3:139-146, 1994.
17. A.J.L. Macario and E.C.De. Macario. Gene Probes for Bacteria. Academic Press, 1990.
18. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
19. P. Raghavan. A probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37:130-143, 1988.
20. R. Ravi and J. D. Kececiogh. Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree, Proc. CPM 95, LNCS 937:330-339, 1995.
21. P. Raghavan and C.D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, 7:365-374, 1987.
22. Peter R. Sibbald and Patrick Argos. Weighting Aligned Protein or Nucleic Acid Sequences to Correct for Unequal Representation. Journal of Molecular Biology, 216, 813-818, 1990.
23. T.F. Smith and M.S. Waterman. Comparison of Biosequences. Adv. Appl. Math., 482-489, 1981.
24. J.D. Thompson, D.G. Higgins and T.J. Gibson. Improved sensitivity of profile searches through the use of sequence weights and gap excision, Comput. Applic. Biosci., 10:19-29, 1994.
25. M. Vingron and P. Argos. A fast and sensitive multiple sequence alignment algorithm. Comput. Appl. Biosci., 5:115-121, 1989.
26. M. Vingron and P.R. Sibbald. Weighting in sequence space: A comparison of methods in terms of generalized sequences. Proc. Natl. Acad. Sci. USA, 90:8777-8781, 1993.