There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 110 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 104 | - |
dc.citation.title | BIOINFORMATICS | - |
dc.citation.volume | 16 | - |
dc.contributor.author | Bhak, Jong Hwa | - |
dc.contributor.author | Holm, Liisa | - |
dc.contributor.author | Chothia, Cyrus | - |
dc.date.accessioned | 2023-12-22T12:08:26Z | - |
dc.date.available | 2023-12-22T12:08:26Z | - |
dc.date.created | 2015-08-03 | - |
dc.date.issued | 2000-02 | - |
dc.description.abstract | Motivation: The Sequence Search Algorithm Assessment and Testing Toolkit (SAT) aims to be a complete package for the comparison of different protein homology search algorithms. The structural classification of proteins can provide us with a clear criterion for judgement in homology detection. There have been several assessments based on structural sequences with classifications but a good deal of similar work is now being repented with locally developed procedures and programs. The SAT will provide developers with a complete package which will save time and produce more comparable performance assessments for search algorithms. The package is complete in the sense that it provides a non-redundant large sequence resource database, a well-characterized query database of proteins domains, all the parsers and some previous results from PSI-BLAST and a hidden markov model algorithm. Results: An analysis on two different data sets was carried out using the SAT package. It compared rite performance of a full protein sequence database (RSDB100) with a non-redundant representative sequence database derived from it (RSDB50). The performance measurement indicated that the full database is sub-optimal for a homology search. This result justifies the use of much smaller and faster RSDB50 than RSDB100 for the SAT | - |
dc.identifier.bibliographicCitation | BIOINFORMATICS, v.16, no.2, pp.104 - 110 | - |
dc.identifier.doi | 10.1093/bioinformatics/16.2.104 | - |
dc.identifier.issn | 1367-4803 | - |
dc.identifier.scopusid | 2-s2.0-0034102579 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/13254 | - |
dc.identifier.url | http://bioinformatics.oxfordjournals.org/content/16/2/104 | - |
dc.identifier.wosid | 000087033600005 | - |
dc.language | 영어 | - |
dc.publisher | OXFORD UNIV PRESS | - |
dc.title.alternative | Sequence search algorithm assessment and testing toolkit (SAT). | - |
dc.title | Sequence search algorithm assessment and testing toolkit (SAT) | - |
dc.type | Article | - |
dc.description.journalRegisteredClass | scopus | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.