Efficient space and time multicomparison of genomes

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/97409

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.author	Messeguer Peypoch, Xavier
dc.contributor.author	Huerta, Mario
dc.date	2003-02
dc.identifier.citation	Messeguer, X., Huerta, M. "Efficient space and time multicomparison of genomes". 2003.
dc.identifier.uri	http://hdl.handle.net/2117/97409
dc.language.iso	eng
dc.relation	LSI-02-64-R
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica
dc.subject	Genomes comparison
dc.subject	MuMs
dc.subject	Suffix trees
dc.subject	Pattern matching
dc.title	Efficient space and time multicomparison of genomes
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.abstract	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.