Genome comparison without alignment using shortest unique substrings

被引：0
|
作者：
Bernhard Haubold
Nora Pierstorff
Friedrich Möller
Thomas Wiehe
机构：
[1] University of Applied Sciences,Department of Biotechnology & Bioinformatics
[2] Universität zu Köln,Institute of Genetics
[3] Berlin Center for Genome Based Bioinformatics and Freie Universität,undefined
来源：
BMC Bioinformatics | / 6卷
关键词：
Upstream Region; Suffix Tree; Mycoplasma Genitalium; Unique Substrings; Combine Length;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Genome comparison without alignment using shortest unique substrings -: art. no. 123
    Haubold, B
    Pierstorff, N
    Möller, F
    Wiehe, T
    BMC BIOINFORMATICS, 2005, 6 (1)
  • [2] Shortest Unique Substrings Queries in Optimal Time
    Tsuruta, Kazuya
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 503 - 513
  • [3] Indexed Matching Statistics and Shortest Unique Substrings
    Belazzougui, Djamal
    Cunial, Fabio
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2014, 2014, 8799 : 179 - 190
  • [4] Algorithms and combinatorial properties on shortest unique palindromic substrings
    Inoue, Hiroe
    Nakashima, Yuto
    Mieno, Takuya
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    JOURNAL OF DISCRETE ALGORITHMS, 2018, 52-53 : 122 - 132
  • [5] Parallel Methods for Finding k-Mismatch Shortest Unique Substrings Using GPU
    Schultz, Daniel W.
    Xu, Bojian
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2021, 18 (01) : 386 - 395
  • [6] Space-efficient algorithms for computing minimal/shortest unique substrings
    Mieno, Takuya
    Koppl, Dominik
    Nakashima, Yuto
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    THEORETICAL COMPUTER SCIENCE, 2020, 845 : 230 - 242
  • [7] Space-time trade-offs for finding shortest unique substrings and maximal unique matches
    Ganguly, Arnab
    Hon, Wing-Kai
    Shah, Rahul
    Thankachan, Sharma V.
    THEORETICAL COMPUTER SCIENCE, 2017, 700 : 75 - 88
  • [8] An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings
    Allen, Daniel R.
    Thankachan, Sharma, V
    Xu, Bojian
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2021, 18 (01) : 138 - 148
  • [9] Nucleotide Sequence Alignment and Compression via Shortest Unique Substring
    Adas, Boran
    Bayraktar, Ersin
    Faro, Simone
    Moustafa, Ibraheem Elsayed
    Kulekci, M. Oguzhan
    BIOINFORMATICS AND BIOMEDICAL ENGINEERING (IWBBIO 2015), PT II, 2015, 9044 : 363 - 374
  • [10] Progressive Alignment using Shortest Common Supersequence
    Garg, Ankush
    Garg, Deepak
    2014 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2014, : 1113 - 1117
12345