Performance evaluation of a new algorithm for the detection of remote homologs with sequence comparison
dc.contributor.author | Kann, Maricel G. | en_US |
dc.contributor.author | Goldstein, Richard A. | en_US |
dc.date.accessioned | 2006-04-19T14:02:04Z | |
dc.date.available | 2006-04-19T14:02:04Z | |
dc.date.issued | 2002-08-01 | en_US |
dc.identifier.citation | Kann, Maricel G.; Goldstein, Richard A. (2002)."Performance evaluation of a new algorithm for the detection of remote homologs with sequence comparison." Proteins: Structure, Function, and Genetics 48(2): 367-376. <http://hdl.handle.net/2027.42/34975> | en_US |
dc.identifier.issn | 0887-3585 | en_US |
dc.identifier.issn | 1097-0134 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/34975 | |
dc.identifier.uri | http://www.ncbi.nlm.nih.gov/sites/entrez?cmd=retrieve&db=pubmed&list_uids=12112703&dopt=citation | en_US |
dc.description.abstract | A detailed analysis of the performance of hybrid , a new sequence alignment algorithm developed by Yu and coworkers that combines Smith Waterman local dynamic programming with a local version of the maximum-likelihood approach, was made to access the applicability of this algorithm to the detection of distant homologs by sequence comparison. We analyzed the statistics of hybrid with a set of nonhomologous protein sequences from the SCOP database and found that the statistics of the scores from hybrid algorithm follows an Extreme Value Distribution with lambda ∼1, as previously shown by Yu et al. for the case of artificially generated sequences. Local dynamic programming was compared to the hybrid algorithm by using two different test data sets of distant homologs from the PFAM and COGs protein sequence databases. The studies were made with several score functions in current use including OPTIMA, a new score function originally developed to detect remote homologs with the Smith Waterman algorithm. We found OPTIMA to be the best score function for both both dynamic programming and the hybrid algorithms. The ability of dynamic programming to discriminate between homologs and nonhomologs in the two sets of distantly related sequences is slightly better than that of hybrid algorithm. The advantage of producing accurate score statistics with only a few simulations may overcome the small differences in performance and make this new algorithm suitable for detection of homologs in conjunction with a wide range of score functions and gap penalties. Proteins 2002;48:367–376. © 2002 Wiley-Liss, Inc. | en_US |
dc.format.extent | 251431 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Wiley Subscription Services, Inc., A Wiley Company | en_US |
dc.subject.other | Chemistry | en_US |
dc.subject.other | Biochemistry and Biotechnology | en_US |
dc.title | Performance evaluation of a new algorithm for the detection of remote homologs with sequence comparison | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Molecular, Cellular and Developmental Biology | en_US |
dc.subject.hlbtoplevel | Health Sciences | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Chemistry, University of Michigan, Ann Arbor, Michigan | en_US |
dc.contributor.affiliationum | Biophysics Research Division, University of Michigan, Ann Arbor, Michigan ; Department of Chemistry, University of Michigan, Ann Arbor, MI 48109-1055 | en_US |
dc.identifier.pmid | 12112703 | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/34975/1/10117_ftp.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1002/prot.10117 | en_US |
dc.identifier.source | Proteins: Structure, Function, and Genetics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.