As the volume of protein sequence data grows, rapid methods for searching the protein sequence database become of primary importance. Rigorous comparison of sequences is obtained with the well-known dynamic programming algorithms. However, these algorithms are not rapid enough to use for routinely s
Protein sequence comparisons: searching databases and aligning sequences
โ Scribed by Russell F Doolittle
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 554 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0958-1669
No coin nor oath required. For personal study only.
โฆ Synopsis
As the explosive growth of sequence databases continues, both the content of these databases and the best strategies for exploiting them are changing. Remarkable improvements in the performance of microcomputers have put very sophisticated tools within the reach of all investigators. New scoring schemes have improved the sensitivity of searching regimens and the accuracy of alignments.
๐ SIMILAR VOLUMES
To elucidate the role of high mass accuracy in mass spectrometric peptide mapping and database searching, selected proteins were subjected to tryptic digestion and the resulting mixtures were analyzed by electrospray ionization on a 7 Tesla Fourier transform mass spectrometer with a mass accuracy of
Sequence alignment programs such as BLAST and PSI-BLAST are used routinely in pairwise, profile-based, or intermediate-sequencesearch (ISS) methods to detect remote homologies for the purposes of fold assignment and comparative modeling. Yet, the sequence alignment quality of these methods at low se