2026-04-17T04:01:22Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/974092025-07-17T08:47:53Zcom_2072_1033col_2072_452950

Efficient space and time multicomparison of genomes Messeguer Peypoch, Xavier Huerta, Mario Universitat Politècnica de Catalunya. Departament de Ciències de la Computació Àrees temàtiques de la UPC::Informàtica Genomes comparison MuMs Suffix trees Pattern matching 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 MUMs is handled with Suffix trees which are those trees that store all suffixes of a given sequence. The searching algorithm builds a generalized suffixtree for each pair and finds the MUMs between them. Postprint (published version) 2003-02 External research report Messeguer, X., Huerta, M. "Efficient space and time multicomparison of genomes". 2003. https://hdl.handle.net/2117/97409 eng LSI-02-64-R Open Access 10 p. application/postscript