Search Results - burrows–wheeler transfer longest common prefix array multithreading parallel algorithms*

  • Showing 1 - 2 results of 2
Refine Results
  1. 1

    Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array by Bonizzoni, Paola, Della Vedova, Gianluca, Pirola, Yuri, Previtali, Marco, Rizzi, Raffaella

    ISSN: 1557-8666, 1557-8666
    Published: United States 01.09.2019
    Published in Journal of computational biology (01.09.2019)
    “…) and the longest common prefix (LCP) array, since solving efficiently both problems are essential ingredients of several algorithms on a collection of strings, such as those for genome assembly…”
    Get more information
    Journal Article
  2. 2

    Computing the longest common prefix array based on the BurrowsWheeler transform by Beller, Timo, Gog, Simon, Ohlebusch, Enno, Schnattinger, Thomas

    ISSN: 1570-8667, 1570-8675
    Published: Elsevier B.V 01.01.2013
    “… In this paper, we present the first algorithm that computes the longest common prefix array directly on the wavelet tree of the Burrows…”
    Get full text
    Journal Article