Efficient space and time multicomparison of genomes
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 suffixe...
| Authors: | , |
|---|---|
| Format: | report |
| Publication Date: | 2003 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97409 |
| Online Access: | https://hdl.handle.net/2117/97409 |
| Access Level: | Open access |
| Keyword: | Genomes comparison MuMs Suffix trees Pattern matching Àrees temàtiques de la UPC::Informàtica |
| Summary: | 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. |
|---|