Cover Image
QR Code

Using the sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem.

Published in:BioMed Research International Vol. 2014; pp. 745298 - 745299
Main Authors: Haj Rachid, Maan, Malluhi, Qutaibah, Abouelhoda, Mohamed
Format: Journal Article
Published: Wiley-Blackwell 2014
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=103823375&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 103823375
    longDbName: CINAHL Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    dissinfo:
    jinfo:
      jid:
        23146133
        FT2T
      jtl: BioMed Research International
      issn: 23146133
      maglogo: N
    pubinfo:
      dt: 2014
      vid: 2014
      pid: 480
      pub: Wiley-Blackwell
      place: Malden, Massachusetts
    artinfo:
      ui:
        103823375
        2012583400
        NLM24834435
        PMC4009283
        103823375
      ppf: 745298
      ppct: 1
      formats:
        fmt:
          @attributes:
            type: P
      tig:
        atl: Using the sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem.
      aug:
        au:
          Haj Rachid, Maan
          Malluhi, Qutaibah
          Abouelhoda, Mohamed
        affil: KINDI Lab for Computing Research, Qatar University P.O. Box 2713, Doha, Qatar.
      sug:
        subj:
          Algorithms
          Bioinformatics
          Databases
          Nematodes
          Statistics
          Time Factors
      pubtype: Academic Journal
      doctype: Journal Article
      ougenre: Article
      ab:
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N