Information Technology Reference
In-Depth Information
7. Wang L., Jiang T.; “ On the complexity of multiple sequence alignment ,” in Journal
of Computational Biology, vol. 1, pp. 337-348, (1994)
8. Garey M. R., Johnson D. S.; ” Computers and Intractability: A Guide to the Theory
of NP-Completeness ,” Freeman, New York (1979).
9. Gupta S. K., Kececioglu, J. D., Schaffer A.; “ Improving the practical space and
time e ciency of the shortest-paths approach to sum-of-pairs multiple sequence
alignment ,” in Journal of Computational Biology, vol. 2, pp. 459-472, (1995)
10. Corpet F.; “ Multiple sequence alignment with hierarchical clustering ,” in Nucleic
Acids Research, vol. 16, pp. 10881-10890, (1988)
11. Wisconsin Package v.8; Genetics Computer Group, Madison, WI. www.gcg.com
12. Thompson J. D., Gibson T. J., Plewniak F., Jeanmougin F., Higgins D. G.; “ The
ClustalX windows interface: flexible strategies for multiple sequence alignment aided
by quality analysis tools ,” in Nucleic Acids Research, vol. 24, pp. 4876-4882, (1997)
13. Thompson J. D., Higgins D. G., Gibson T. J.; “ CLUSTAL W: improving the
sensitivity of progressive multiple sequence alignment through sequence weighting,
position-specific gap penalties and weight matrix choice ,” in Nucleic Acids Research,
vol. 22, pp. 4673-4680, (1994)
14. Notredame C., Higgins D. G., Heringa J.; “ T-Coffee: a novel method for fast and
accurate Multiple Sequence Alignment ,” in Journal Molecular Biology, vol. 302, pp.
205-217, (2000)
15. Zhou H., Zhou Y.; “ SPEM: Improving multiple sequence alignment with sequence
profiles and predicted secondary structures ,” in Bioinformatics, vol. 21, pp. 3615-
3621, (2005)
16. Do C. B., Mahabhashyam M. S. P., Brudno M., Batzoglou S.; “ ProbCons: Prob-
abilistic consistency-based multiple sequence alignment ,” in Genome Research,
vol. 15, pp. 330-340, (2005)
17. Smith R. F., Smith T. F.; “ Pattern-induced multi-sequence alignment (PIMA) algo-
rithm employing secondary structure-dependent gap penalties for use in comparative
protein modelling ,” in Protein Engineering, vol. 5, pp. 35-41,(1992).
18. Carrillo H., Lipman D. J.; “ The Multiple Sequence Alignment Problem in Biology ,”
in SIAM Journal on Applied Mathematics, vol. 48, pp. 1073-1082, (1988)
19. Stoye J., Moulton V., Dress A. W.; “ DCA: an e cient implementation of the
divide-and conquer approach to simultaneous multiple sequence alignment ,” in
Bioinformatics, vol. 13 (6), pp. 625-626, (1997)
20. Morgenstern B., Frech K., Dress A., Werner T.; “ DIALIGN: Finding local similari-
ties by multiple sequence alignment ,” in Bioinformatics, vol. 14, pp. 290-294,(1998)
21. Morgenstern B., Frech K., Dress A., Werner T.; “ DIALIGN 2: improvement of the
segment-to-segment approach to multiple sequence alignment ,” in Bioinformatics,
vol. 15, pp. 211-218, (1999)
22. Gotoh O; “ Further improvement in methods of group-to-group sequence alignment
with generalized profile operations ,” in Bioinformatics, vol. 10 (4), pp. 379-387,
(1994)
23. Eddy S. R.; “ Multiple alignment using hidden Markov models ,” in 3 rd International
Conference on Intelligent Systems for Molecular Biology, vol. 3, pp. 114-120, (1995)
24. Edgar R. C.; “ MUSCLE: multiple sequence alignment with high accuracy and high
throughput ,” in Nucleic Acids Research, vol. 32, pp. 1792-1797, (2004)
25. Notredame C., Higgins D.G.; “ SAGA: sequence alignment by genetic algorithm ,”
in Nucleic Acids Research, vol. 24, pp. 1515-1539, (1996)
26. Notredame C.; “ COFFEE: an objective function for multiple sequence alignments ,”
in Bioinformatics, vol. 14, pp. 407-422, (1998)
Search WWH ::




Custom Search