Now showing items 1-3 of 3

    • Efficient space and time multicomparison of genomes 

      Messeguer Peypoch, Xavier; Huerta, Mario (2003-02)
      External research report
      Open Access
      The comparison of genomes is based on substrings, called MUMs, that appear only once in each genome and are maximal. The set of MUMs determines the skeleton from which a global comparison can be established. The search of ...
    • Modelling non-functional requirements 

      Botella López, Pere; Burgués Illa, Xavier; Franch Gutiérrez, Javier; Huerta, Mario; Salazar, Guadalupe (Universidad de Sevilla, 2001)
      Conference report
      Open Access
      We present in this paper the language NoFun for stating component quality in the framework of the ISO/IEC quality standards. The language consists of three different parts. In the first one, software quality characteristics ...
    • Slide suffix tree construction algorithm 

      Huerta, Mario (2002-10-09)
      External research report
      Open Access
      The suffix tree is the most powerful and versatile structure in the string matching. For this structure, the classical construction algorithms in linear time are the Weiner, the McCreight and the Ukkonen algorithm. In ...