Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/130099
DC Field | Value | |
---|---|---|
dc.title | Run probability of high-order seed patterns and its applications to finding good transition seeds | |
dc.contributor.author | Yang, J.L. | |
dc.contributor.author | Zhang, L.X. | |
dc.date.accessioned | 2016-11-11T08:00:55Z | |
dc.date.available | 2016-11-11T08:00:55Z | |
dc.date.issued | 2008 | |
dc.identifier.citation | Yang, J.L., Zhang, L.X. (2008). Run probability of high-order seed patterns and its applications to finding good transition seeds. Series on Advances in Bioinformatics and Computational Biology 6 : 123-132. ScholarBank@NUS Repository. | |
dc.identifier.isbn | 9781848161085 | |
dc.identifier.issn | 17516404 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/130099 | |
dc.description.abstract | Transition seeds exhibit a good tradeoff between sensitivity and specificity for homology search in both coding and non-coding regions. But, identifying good transition seeds is extremely hard. We study the hit probability of high-order seed patterns. Based on our theoretical results, we propose an efficient method for ranking transition seeds for seed design. | |
dc.source | Scopus | |
dc.subject | High-order seed pattern | |
dc.subject | Run statistics | |
dc.subject | Sensitivity analysis | |
dc.subject | Transition seed | |
dc.type | Conference Paper | |
dc.contributor.department | MATHEMATICS | |
dc.description.sourcetitle | Series on Advances in Bioinformatics and Computational Biology | |
dc.description.volume | 6 | |
dc.description.page | 123-132 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.