Mostra el registre d'ítem simple

Efficient space and time multicomparison of genomes

dc.contributor.authorMesseguer Peypoch, Xavier
dc.contributor.authorHuerta, Mario
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-11-29T12:10:12Z
dc.date.available2016-11-29T12:10:12Z
dc.date.issued2003-02
dc.identifier.citationMesseguer, X., Huerta, M. "Efficient space and time multicomparison of genomes". 2003.
dc.identifier.urihttp://hdl.handle.net/2117/97409
dc.description.abstractThe 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.
dc.format.extent10 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-02-64-R
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherGenomes comparison
dc.subject.otherMuMs
dc.subject.otherSuffix trees
dc.subject.otherPattern matching
dc.titleEfficient space and time multicomparison of genomes
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1898427
dc.description.versionPostprint (published version)
local.citation.authorMesseguer, X.; Huerta, M.


Fitxers d'aquest items

Thumbnail
Nom:
R02-64.ps
Mida:
1,668Mb
Format:
Postscript
Visualitza/Obre

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple