Probalign: Multiple sequence alignment using partition function posterior probabilities.

Probalign: Multiple sequence alignment using partition function posterior probabilities. Roshan, U. & Livesay, D. R Bioinformatics, 22(22):2715–2721, 2006.
doi abstract bibtex

MOTIVATION: The maximum expected accuracy optimization criterion for multiple sequence alignment uses pairwise posterior probabilities of residues to align sequences. The partition function methodology is one way of estimating these probabilities. Here, we combine these two ideas for the first time to construct maximal expected accuracy sequence alignments. RESULTS: We bridge the two techniques within the program Probalign. Our results indicate that Probalign alignments are generally more accurate than other leading multiple sequence alignment methods (i.e. Probcons, MAFFT and MUSCLE) on the BAliBASE 3.0 protein alignment benchmark. Similarly, Probalign also outperforms these methods on the HOMSTRAD and OXBENCH benchmarks. Probalign ranks statistically highest (P-value < 0.005) on all three benchmarks. Deeper scrutiny of the technique indicates that the improvements are largest on datasets containing N/C-terminal extensions and on datasets containing long and heterogeneous length proteins. These points are demonstrated on both real and simulated data. Finally, our method also produces accurate alignments on long and heterogeneous length datasets containing protein repeats. Here, alignment accuracy scores are at least 10% and 15% higher than the other three methods when standard deviation of length is >300 and 400, respectively. AVAILABILITY: Open source code implementing Probalign as well as for producing the simulated data, and all real and simulated data are freely available from http://www.cs.njit.edu/usman/probalign

@Article{roshan06probalign,
  author    = {Usman Roshan and Dennis R Livesay},
  title     = {Probalign: Multiple sequence alignment using partition function posterior probabilities.},
  journal   = {Bioinformatics},
  year      = {2006},
  volume    = {22},
  number    = {22},
  pages     = {2715--2721},
  abstract  = {MOTIVATION: The maximum expected accuracy optimization criterion for multiple sequence alignment uses pairwise posterior probabilities of residues to align sequences. The partition function methodology is one way of estimating these probabilities. Here, we combine these two ideas for the first time to construct maximal expected accuracy sequence alignments. RESULTS: We bridge the two techniques within the program Probalign. Our results indicate that Probalign alignments are generally more accurate than other leading multiple sequence alignment methods (i.e. Probcons, MAFFT and MUSCLE) on the BAliBASE 3.0 protein alignment benchmark. Similarly, Probalign also outperforms these methods on the HOMSTRAD and OXBENCH benchmarks. Probalign ranks statistically highest (P-value < 0.005) on all three benchmarks. Deeper scrutiny of the technique indicates that the improvements are largest on datasets containing N/C-terminal extensions and on datasets containing long and heterogeneous length proteins. These points are demonstrated on both real and simulated data. Finally, our method also produces accurate alignments on long and heterogeneous length datasets containing protein repeats. Here, alignment accuracy scores are at least 10\% and 15\% higher than the other three methods when standard deviation of length is >300 and 400, respectively. AVAILABILITY: Open source code implementing Probalign as well as for producing the simulated data, and all real and simulated data are freely available from http://www.cs.njit.edu/usman/probalign},
  doi       = {10.1093/bioinformatics/btl472},
  keywords  = {Multiple Sequence Alignment},
  owner     = {Sebastian},
  pmid      = {16954142},
  timestamp = {2009.06.09},
}

Downloads: 0

{"_id":"onj5iLu4kSLhi4qW4","bibbaseid":"roshan-livesay-probalignmultiplesequencealignmentusingpartitionfunctionposteriorprobabilities-2006","authorIDs":[],"author_short":["Roshan, U.","Livesay, D. R"],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Usman"],"propositions":[],"lastnames":["Roshan"],"suffixes":[]},{"firstnames":["Dennis","R"],"propositions":[],"lastnames":["Livesay"],"suffixes":[]}],"title":"Probalign: Multiple sequence alignment using partition function posterior probabilities.","journal":"Bioinformatics","year":"2006","volume":"22","number":"22","pages":"2715–2721","abstract":"MOTIVATION: The maximum expected accuracy optimization criterion for multiple sequence alignment uses pairwise posterior probabilities of residues to align sequences. The partition function methodology is one way of estimating these probabilities. Here, we combine these two ideas for the first time to construct maximal expected accuracy sequence alignments. RESULTS: We bridge the two techniques within the program Probalign. Our results indicate that Probalign alignments are generally more accurate than other leading multiple sequence alignment methods (i.e. Probcons, MAFFT and MUSCLE) on the BAliBASE 3.0 protein alignment benchmark. Similarly, Probalign also outperforms these methods on the HOMSTRAD and OXBENCH benchmarks. Probalign ranks statistically highest (P-value < 0.005) on all three benchmarks. Deeper scrutiny of the technique indicates that the improvements are largest on datasets containing N/C-terminal extensions and on datasets containing long and heterogeneous length proteins. These points are demonstrated on both real and simulated data. Finally, our method also produces accurate alignments on long and heterogeneous length datasets containing protein repeats. Here, alignment accuracy scores are at least 10% and 15% higher than the other three methods when standard deviation of length is >300 and 400, respectively. AVAILABILITY: Open source code implementing Probalign as well as for producing the simulated data, and all real and simulated data are freely available from http://www.cs.njit.edu/usman/probalign","doi":"10.1093/bioinformatics/btl472","keywords":"Multiple Sequence Alignment","owner":"Sebastian","pmid":"16954142","timestamp":"2009.06.09","bibtex":"@Article{roshan06probalign,\n author = {Usman Roshan and Dennis R Livesay},\n title = {Probalign: Multiple sequence alignment using partition function posterior probabilities.},\n journal = {Bioinformatics},\n year = {2006},\n volume = {22},\n number = {22},\n pages = {2715--2721},\n abstract = {MOTIVATION: The maximum expected accuracy optimization criterion for multiple sequence alignment uses pairwise posterior probabilities of residues to align sequences. The partition function methodology is one way of estimating these probabilities. Here, we combine these two ideas for the first time to construct maximal expected accuracy sequence alignments. RESULTS: We bridge the two techniques within the program Probalign. Our results indicate that Probalign alignments are generally more accurate than other leading multiple sequence alignment methods (i.e. Probcons, MAFFT and MUSCLE) on the BAliBASE 3.0 protein alignment benchmark. Similarly, Probalign also outperforms these methods on the HOMSTRAD and OXBENCH benchmarks. Probalign ranks statistically highest (P-value < 0.005) on all three benchmarks. Deeper scrutiny of the technique indicates that the improvements are largest on datasets containing N/C-terminal extensions and on datasets containing long and heterogeneous length proteins. These points are demonstrated on both real and simulated data. Finally, our method also produces accurate alignments on long and heterogeneous length datasets containing protein repeats. Here, alignment accuracy scores are at least 10\\% and 15\\% higher than the other three methods when standard deviation of length is >300 and 400, respectively. AVAILABILITY: Open source code implementing Probalign as well as for producing the simulated data, and all real and simulated data are freely available from http://www.cs.njit.edu/usman/probalign},\n doi = {10.1093/bioinformatics/btl472},\n keywords = {Multiple Sequence Alignment},\n owner = {Sebastian},\n pmid = {16954142},\n timestamp = {2009.06.09},\n}\n\n","author_short":["Roshan, U.","Livesay, D. R"],"key":"roshan06probalign","id":"roshan06probalign","bibbaseid":"roshan-livesay-probalignmultiplesequencealignmentusingpartitionfunctionposteriorprobabilities-2006","role":"author","urls":{},"keyword":["Multiple Sequence Alignment"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:42.589Z","downloads":0,"keywords":["multiple sequence alignment"],"search_terms":["probalign","multiple","sequence","alignment","using","partition","function","posterior","probabilities","roshan","livesay"],"title":"Probalign: Multiple sequence alignment using partition function posterior probabilities.","year":2006,"dataSources":["C5FtkvWWggFfMJTFX"]}