Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Multiple Sequenzalignments: eine Einführung Read chapter Read first chapter

2019 | OriginalPaper | Chapter

3. Übersicht aktueller MSA-Programme

Author : Theodor Sperlea

Published in: Multiple Sequenzalignments

Publisher: Springer Berlin Heidelberg

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Zusammenfassung

Während die Begriffe ,,Algorithmus“ und ,,Programm“ umgangssprachlich zuweilen synonym verwendet werden, bezeichnen sie in der Informatik klar getrennte Konzepte. Ein Algorithmus ist eine Art abstrakte Beschreibung einer Handlungsanweisung, beschreibt also in mehr oder weniger hoher Detailtiefe die Einzelschritte einer Berechnung. Algorithmen sind von einer Programmiersprache unabhängig und dienen deswegen nicht als Handlungsbefehl an einen Computer, sondern der Kommunikation eines Konzeptes an andere Personen.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Wie funktionieren MSA-Programme?
next chapter Details zur Analyse der Programme
Literature
5.
Armougom F, Moretti S, Poirot O, Audic S, Dumas P, Schaeli B, Keduas V, Notredame C (2006) Expresso: automatic incorporation of structural information in multiple sequence alignments using 3d-coffee. Nucleic Acids Res 34(Web Server):W604–W608PubMedPubMedCentralCrossRef
8.
Bawono P, Dijkstra M, Pirovano W, Feenstra A, Abeln S, Heringa J (2016) Multiple sequence alignment. In: Methods in molecular biology. Humana Press Inc., New York, S 167–189
9.
Bernhart SH, Hofacker IL, Stadler PF (2005) Local RNA base pairing probabilities in large sequences. Bioinformatics 22(5):614–615PubMedCrossRef
10.
Blackshields G, Sievers F, Shi W, Wilm A, Higgins DG (2010) Sequence embedding for fast construction of guide trees for multiple sequence alignment. Algorithms Mol Biol 5(1):21PubMedPubMedCentralCrossRef
13.
Chaichoompu K, Kittitornkun S, Tongsima S (2006) MT-ClustalW: multithreading multiple sequence alignment. In: Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
15.
Chang J-M, Tommaso PD, Taly J-F, Notredame C (2012) Accurate multiple sequence alignment of transmembrane proteins with PSI-coffee. BMC Bioinf 13(Suppl 4):S1CrossRef
21.
22.
23.
24.
Edgar RC(2004) Muscle: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinf 5(1):113CrossRef
26.
Feng D-F, Doolittle RF (1987) Progressive sequence alignment as a prerequisitetto correct phylogenetic trees. J Mol Evol 25(4):351–360PubMedCrossRef
27.
Floden EW, Tommaso PD, Chatzou M, Magis C, Notredame C, Chang J-M (2016) PSI/TM-coffee: a web server for fast and accurate multiple sequence alignments of regular and transmembrane proteins using homology extension on reduced databases. Nucleic Acids Res 44(W1):W339–W343PubMedPubMedCentralCrossRef
29.
30.
Garnier J, Gibrat J-F, Robson B (1996) [32] GOR method for predicting protein secondary structure from amino acid sequence. In: Methods in enzymology. Academic Press, Cambridge, S 540–553
32.
Gotoh O (1996) Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments. J Mol Biol 264(4):823–838PubMedCrossRef
34.
Grantham R (1974) Amino acid difference formula to help explain protein evolution. Science 185(4154):862–864PubMedCrossRef
38.
Heringa J (1999) Two strategies for sequence comparison: profile-preprocessed and secondary structure-induced multiple alignment. Comput Chem 23(3–4):341–364PubMedCrossRef
39.
Heringa J (2002) Local weighting schemes for protein multiple sequence alignment. Comput Chem 26(5):459–477PubMedCrossRef
40.
Higgins DG, Sharp PM (1988) CLUSTAL: a package for performing multiple sequence alignment on a microcomputer. Gene 73(1):237–244PubMedCrossRef
41.
43.
Jones DT (1999) Protein secondary structure prediction based on position-specific scoring matrices 11 edited by G. Von Heijne. J Mol Biol 292(2):195–202CrossRef
44.
Käll L, Krogh A, Sonnhammer ELL (2004) A combined transmembrane topology and signal peptide prediction method. J Mol Biol 338(5):1027–1036PubMedCrossRef
45.
46.
47.
Katoh K, Standley DM (2016) A simple method to control over-alignment in the MAFFT multiple sequence alignment program. Bioinformatics 32(13):1933–1942PubMedPubMedCentralCrossRef
50.
51.
Kimura M (1983) The neutral theory of molecular evolution. Cambridge University Press, CambridgeCrossRef
53.
Krogh A, Larsson B, von Heijne G, Sonnhammer ELL (2001) Predicting transmembrane protein topology with a hidden markov model: application to complete genomes11edited by F. Cohen. J Mol Biol 305(3):567–580CrossRef
55.
Larkin MA, Blackshields G, Brown NP, Chenna R, McGettigan PA, McWilliam H, Valentin F, Wallace IM, Wilm A, Lopez R, Thompson JD, Gibson TJ, Higgins DG (2007) Clustal W and clustal X version 2.0. Bioinformatics 23(21):2947–2948CrossRefPubMed
57.
Lassmann T, Sonnhammer ELL (2005) Kalign an accurate and fast multiple sequence alignment algorithm. BMC Bioinf 6(1):298CrossRef
59.
Lee C, Grasso C, Sharlow MF (2002) Multiple sequence alignment using partial order graphs. Bioinformatics 18(3):452–464PubMedCrossRef
61.
Liu Y, Schmidt B, Maskell DL (2010) MSAProbs: multiple sequence alignment based on pair hidden markov models and partition function posterior probabilities. Bioinformatics 26(16):1958–1964PubMedCrossRef
63.
Loytynoja A, Goldman N (2005) From the cover: an algorithm for progressive multiple alignment of sequences with insertions. Proc Natl Acad Sci U S A 102(30):10557–10562PubMedPubMedCentralCrossRef
64.
Loytynoja A, Goldman N (2008) Phylogeny-aware gap placement prevents errors in sequence alignment and evolutionary analysis. Science 320(5883):1632–1635PubMedCrossRef
65.
Lyras DP, Metzler D (2014) ReformAlign: improved multiple sequence alignments using a profile-based meta-alignment approach. BMC Bioinf 15(1):265CrossRef
70.
Morgenstern B (1999) DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics 15(3):211–218PubMedCrossRef
71.
Morgenstern B, Dress A, Werner T (1996) Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc Natl Acad Sci 93(22):12098–12103PubMedCrossRefPubMedCentral
73.
Morrison DA (2015) Multiple sequence alignment methods (Hrsg DJ Russell, Bd 64. Humana Press, New York
75.
Ng PC, Henikoff JG, Henikoff JG (2000) PHAT: a transmembrane-specific substitution matrix. Bioinformatics 16(9):760–766PubMedCrossRef
77.
78.
Notredame C, Higgins DG, Heringa J (2000) T-coffee: a novel method for fast and accurate multiple sequence alignment. J Mol Biol 302(1):205–217PubMedCrossRef
79.
Notredame C, Holm L, Higgins DG (1998) COFFEE: an objective function for multiple sequence alignments. Bioinformatics 14(5):407–422PubMedCrossRef
80.
81.
Dayhoff MO, Schwartz RM, Orcutt BC (1978) A model of evolutionary change in proteins. In: Dayhoff MO (ed) Atlas of protein sequence and structure, vol 5. National Biomedical Research Foundation, Washington
83.
Oliver T, Schmidt B, Nathan D, Clemens R, Maskell D (2005) Using reconfigurable hardware to accelerate multiple sequence alignment with ClustalW. Bioinformatics 21(16):3431–3432PubMedCrossRef
85.
O’Sullivan O, Suhre K, Abergel C, Higgins DG, Notredame C (2004) 3DCoffee: combining protein sequences and structures within multiple sequence alignments. J Mol Biol 340(2):385–395PubMedCrossRef
86.
90.
Pirovano W, Feenstra KA, Heringa J (2008) PRALINETM: a strategy for improved multiple alignment of transmembrane proteins. Bioinformatics 24(4):492–497PubMedCrossRef
96.
Sahraeian SME, Yoon B-J (2011) PicXAA-web: a web-based platform for non-progressive maximum expected accuracy alignment of multiple biological sequences. Nucleic Acids Res 39(suppl):W8–W12PubMedPubMedCentralCrossRef
97.
Sahraeian SME, Yoon B-J (2010) PicXAA: greedy probabilistic construction of maximum expected accuracy alignment of multiple sequences. Nucleic Acids Res 38(15):4917–4928PubMedPubMedCentralCrossRef
99.
Shi J, Blundell TL, Mizuguchi K (2001) FUGUE: sequence-structure homology recognition using environment-specific substitution tables and structure-dependent gap penalties11edited by B. Honig. J Mol Biol 310(1):243–257CrossRef
100.
Sievers F, Wilm A, Dineen D, Gibson TJ, Karplus K, Li W, Lopez R, McWilliam H, Remmert M, Soding J, Thompson JD, Higgins DG (2014) Fast & scalable generation of high-quality protein multiple sequence alignments using clustal omega. Mol Syst Biol 7(1):539–539CrossRef
101.
102.
Simossis VA, Heringa J (2005) PRALINE: a multiple sequence alignment toolbox that integrates homology-extended and secondary structure information. Nucleic Acids Res 33(Web Server):W289–W294PubMedPubMedCentralCrossRef
103.
Simossis VA, Heringa J (2003) The PRALINE online server: optimising progressive multiple alignment on the web. Comput Biol Chem 27(4–5):511–519PubMedCrossRef
105.
109.
Subramanian AR, Kaufmann M, Morgenstern B (2008) DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms Mol Biol 3(1):6PubMedPubMedCentralCrossRef
110.
Subramanian AR, Weyer-Menkhoff J, Kaufmann M, Morgenstern B (2005) Dialign-t: an improved algorithm for segment-based multiple sequence alignment. BMC Bioinf 6(1):66CrossRef
114.
Thompson JD, Higgins DG, Gibson TJ (1994) CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weightingposition-specific gap penalties and weight matrix choice. Nucleic Acids Res 22(22):4673–4680PubMedPubMedCentralCrossRef
118.
Tusnady GE, Simon I (2001) The HMMTOP transmembrane topology prediction server. Bioinformatics 17(9):849–850PubMedCrossRef
119.
Viklund H, Elofsson A (2008) OCTOPUS: improving topology prediction by two-track ANN-based preference scores and an extended topological grammar. Bioinformatics 24(15): 1662–1668PubMedCrossRef
122.
123.
Van Walle I, Lasters I, Wyns L (2004) Align-m – a new algorithm for multiple alignment of highly divergent sequences. Bioinformatics 20(9):1428–1435PubMedCrossRef
127.
128.
Wright ES (2015) DECIPHER: harnessing local sequence context to improve protein multiple sequence alignment. BMC Bioinf 16(1):322CrossRef
129.
Wu S, Manber U (1992) Fast text searching: allowing errors. Commun ACM 35(10):83–91CrossRef
130.
Metadata
Title
Übersicht aktueller MSA-Programme
Author
Theodor Sperlea
Copyright Year
2019
Publisher
Springer Berlin Heidelberg
Book
Multiple Sequenzalignments

Print ISBN: 978-3-662-58810-9

Electronic ISBN: 978-3-662-58811-6

Copyright Year: 2019

DOI
https://doi.org/10.1007/978-3-662-58811-6_3

Premium Partner

    Image Credits