Cargando…
Sequence Comparison Alignment-Free Approach Based on Suffix Tree and L-Words Frequency
The vast majority of methods available for sequence comparison rely on a first sequence alignment step, which requires a number of assumptions on evolutionary history and is sometimes very difficult or impossible to perform due to the abundance of gaps (insertions/deletions). In such cases, an alter...
Autores principales: | Soares, Inês, Goios, Ana, Amorim, António |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
The Scientific World Journal
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3444837/ https://www.ncbi.nlm.nih.gov/pubmed/22997494 http://dx.doi.org/10.1100/2012/450124 |
Ejemplares similares
-
Relative Suffix Trees
por: Farruggia, Andrea, et al.
Publicado: (2018) -
Aging and Mixed Emotions: A Word-Suffix Approach in Free Recall
por: Palumbo, Rocco, et al.
Publicado: (2023) -
Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
por: Haj Rachid, Maan, et al.
Publicado: (2014) -
Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words
por: Bonizzoni, Paola, et al.
Publicado: (2020) -
Fast alignment-free sequence comparison using spaced-word frequencies
por: Leimeister, Chris-Andre, et al.
Publicado: (2014)