SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size.
about
Geometric aspects of biological sequence comparison.Acceleration of sequence clustering using longest common subsequence filteringDatabase indexing for production MegaBLAST searchesTowards computational improvement of DNA database indexing and short DNA query searchingSequence alignment by cross-correlation.Compressed indexing and local alignment of DNA.
P2860
SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size.
description
2002 nî lūn-bûn
@nan
2002年の論文
@ja
2002年学术文章
@wuu
2002年学术文章
@zh
2002年学术文章
@zh-cn
2002年学术文章
@zh-hans
2002年学术文章
@zh-my
2002年学术文章
@zh-sg
2002年學術文章
@yue
2002年學術文章
@zh-hant
name
SST: an algorithm for finding ...... ogarithm of the database size.
@en
SST: an algorithm for finding ...... ogarithm of the database size.
@nl
type
label
SST: an algorithm for finding ...... ogarithm of the database size.
@en
SST: an algorithm for finding ...... ogarithm of the database size.
@nl
prefLabel
SST: an algorithm for finding ...... ogarithm of the database size.
@en
SST: an algorithm for finding ...... ogarithm of the database size.
@nl
P2093
P356
P1433
P1476
SST: an algorithm for finding ...... ogarithm of the database size.
@en
P2093
Eldar Giladi
James Z Wang
Michael G Walker
Wayne Volkmuth
P304
P356
10.1093/BIOINFORMATICS/18.6.873
P407
P577
2002-06-01T00:00:00Z