메뉴 건너뛰기




Volumn 3, Issue 1, 2008, Pages

Fast algorithms for computing sequence distances by exhaustive substring composition

Author keywords

[No Author keywords available]

Indexed keywords


EID: 58149496557     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/1748-7188-3-13     Document Type: Article
Times cited : (25)

References (21)
  • 3
    • 0001902056 scopus 로고
    • Three approaches to the quantitative definition of information
    • Kolmogorov A Three approaches to the quantitative definition of information Problemi Pederachi Inf 1965 1
    • (1965) Problemi Pederachi Inf , vol.1
    • Kolmogorov, A.1
  • 4
    • 0016880887 scopus 로고
    • On the complexity of finite sequences
    • 10.1109/TIT.1976.1055501
    • Lempel A Ziv J On the complexity of finite sequences IEEE Transactions on Information Theory 1976, 22:75-81. 10.1109/TIT.1976.1055501
    • (1976) IEEE Transactions on Information Theory , vol.22 , pp. 75-81
    • Lempel, A.1    Ziv, J.2
  • 6
    • 0022743812 scopus 로고
    • A measure of the similarity of sets of sequences not requiring sequence alignment
    • Blaidsell B A measure of the similarity of sets of sequences not requiring sequence alignment Proceedings of the National Academy of Sciences 1986, 5155-5159.
    • (1986) Proceedings of the National Academy of Sciences , pp. 5155-5159
    • Blaidsell, B.1
  • 7
    • 1242320272 scopus 로고    scopus 로고
    • Local homology recognition and distance measures in linear time using compressed amino-acid alphabets
    • 373290 14729922 10.1093/nar/gkh180
    • Edgar R Local homology recognition and distance measures in linear time using compressed amino-acid alphabets Nucleic Acids Res 2004, 32(1):380-385. 373290 14729922 10.1093/nar/gkh180
    • (2004) Nucleic Acids Res , vol.32 , Issue.1 , pp. 380-385
    • Edgar, R.1
  • 8
    • 34547753523 scopus 로고    scopus 로고
    • Compression-based classification of biological sequences and structures via the Universal Similarity Metric: Experimental assessment
    • 1939857 17629909 10.1186/1471-2105-8-252
    • Ferragina P Giancarlo R Greco V Manzini G Valiente G Compression-based classification of biological sequences and structures via the Universal Similarity Metric: Experimental assessment BMC Bioinformatics 2007, 8:252-272. 1939857 17629909 10.1186/1471-2105-8-252
    • (2007) BMC Bioinformatics , vol.8 , pp. 252-272
    • Ferragina, P.1    Giancarlo, R.2    Greco, V.3    Manzini, G.4    Valiente, G.5
  • 9
    • 3242889314 scopus 로고    scopus 로고
    • Procaryote phylogeny without sequence alignment: From avoidance singature to composition distance
    • 10.1142/S0219720004000442
    • Hao B Qi J Procaryote phylogeny without sequence alignment: From avoidance singature to composition distance Journal of Bioinformatics and Computational Biology 2004, 2:1-19. 10.1142/S0219720004000442
    • (2004) Journal of Bioinformatics and Computational Biology , vol.2 , pp. 1-19
    • Hao, B.1    Qi, J.2
  • 10
  • 12
    • 0242643741 scopus 로고    scopus 로고
    • A new sequence distance measure for phylogenetic tree reconstruction
    • 10.1093/bioinformatics/btg295 14594718
    • Otu H Sayood K A new sequence distance measure for phylogenetic tree reconstruction Bioinformatics 2003, 19:2122-2130. 10.1093/bioinformatics/ btg295 14594718
    • (2003) Bioinformatics , vol.19 , pp. 2122-2130
    • Otu, H.1    Sayood, K.2
  • 13
    • 1242335920 scopus 로고    scopus 로고
    • Whole proteome prokaryote phylogeny without sequence alignment: A k-string composition approach
    • 10.1007/s00239-003-2493-7
    • Qi J Wang B Hao B Whole proteome prokaryote phylogeny without sequence alignment: A k-string composition approach Molecular Evolution 2004, 58(1):1-11. 10.1007/s00239-003-2493-7
    • (2004) Molecular Evolution , vol.58 , Issue.1 , pp. 1-11
    • Qi, J.1    Wang, B.2    Hao, B.3
  • 14
    • 33646005790 scopus 로고    scopus 로고
    • The average common substring approach to phylogenetic reconstruction
    • 10.1089/cmb.2006.13.336 16597244
    • Ulitsky I Burstein D Tuller T Chor B The average common substring approach to phylogenetic reconstruction Journal of Computational Biology 2006, 13(2):336-350. 10.1089/cmb.2006.13.336 16597244
    • (2006) Journal of Computational Biology , vol.13 , Issue.2 , pp. 336-350
    • Ulitsky, I.1    Burstein, D.2    Tuller, T.3    Chor, B.4
  • 15
    • 1042269469 scopus 로고    scopus 로고
    • Alignment-free sequence comparison - A review
    • 10.1093/bioinformatics/btg392 14734312
    • Vinga S Almeida J Alignment-free sequence comparison - a review Bioinformatics 2004, 20:206-215. 10.1093/bioinformatics/btg392 14734312
    • (2004) Bioinformatics , vol.20 , pp. 206-215
    • Vinga, S.1    Almeida, J.2
  • 16
    • 1342309208 scopus 로고    scopus 로고
    • Metrics for comparing regulatory sequences on the basis of pattern counts
    • 10.1093/bioinformatics/btg425 14764560
    • Helden JV Metrics for comparing regulatory sequences on the basis of pattern counts Bioinformatics 2004, 20:399-406. 10.1093/bioinformatics/ btg425 14764560
    • (2004) Bioinformatics , vol.20 , pp. 399-406
    • Helden, J.V.1
  • 17
    • 0031437248 scopus 로고    scopus 로고
    • A measure of dna dissimilarity based on the mahalanobis distance between frequencies of words
    • 10.2307/2533509 9423258
    • Wu TJ Bruke J Davison D A measure of dna dissimilarity based on the mahalanobis distance between frequencies of words Biometrics 1997, 53:1431-1439. 10.2307/2533509 9423258
    • (1997) Biometrics , vol.53 , pp. 1431-1439
    • Wu, T.J.1    Bruke, J.2    Davison, D.3
  • 19
    • 0002139526 scopus 로고
    • The myriad virtues of suffix trees
    • Berlin: Springer-Verlang Apostolico A, Galil Z
    • Apostolico A The myriad virtues of suffix trees Combinatorial Algorithms on words Berlin: Springer-Verlang Apostolico A, Galil Z 1985, 85-96.
    • (1985) Combinatorial Algorithms on Words , pp. 85-96
    • Apostolico, A.1
  • 20
    • 0038148917 scopus 로고    scopus 로고
    • Truncated suffix trees and their application to data compression
    • 10.1016/S0304-3975(03)00053-7
    • Na J Apostolico A Iliopoulos CS Park K Truncated suffix trees and their application to data compression Theoretical Computer Science 2003, 304:87-101. 10.1016/S0304-3975(03)00053-7
    • (2003) Theoretical Computer Science , vol.304 , pp. 87-101
    • Na, J.1    Apostolico, A.2    Iliopoulos, C.S.3    Park, K.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.