|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 10 van 11 gevonden artikelen
| Titel: |
The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications |
| Auteur: |
Iliopoulos, Costas S. Makris, Christos Panagis, Yannis Perdikuri, Katerina Theodoridis, Evangelos Tsakalidis, Athanasios |
| Verschenen in: |
Fundamenta informaticae |
| Paginering: | Jaargang 71 (2006) nr. 2-3 pagina's 259-277 |
| Jaar: |
2006-06-15 |
| Inhoud: |
In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Weighted Sequences can model important biological processes such as the DNA Assembly Process or the DNA-Protein Binding Process. Thus pattern matching or identification of repeated patterns, in biological weighted sequences is a very important procedure in the translation of gene expression and regulation. We present time and space efficient algorithms for constructing the weighted suffix tree and some applications of the proposed data structure to problems taken from the Molecular Biology area such as pattern matching, repeats discovery, discovery of the longest common subsequence of two weighted sequences and computation of covers. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 10 van 11 gevonden artikelen
| << vorige | volgende >> |