Concept of strings and Trees in Bioinformatics
| dc.contributor.author | Oladele, Tinuke Omolewa | |
| dc.contributor.author | Bamigbola, O. M. | |
| dc.contributor.author | Gbadeyan, J. A. | |
| dc.date.accessioned | 2023-05-11T10:17:22Z | |
| dc.date.available | 2023-05-11T10:17:22Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | Strings have been found to be the most general medium for the representation of information. Considering the large amount of data stored in data dictionaries, databases or the massive data in genomic databases, text remains the main form of exchanging information. The representation of information from real-world problem may involve the use of many interlinked data structures. In this paper, the suffix tree data structure was used to solve the Pattern Matching problem. We present the suffix tree as an efficient data structure that provides efficient access to all substrings of a string. It is able to rapidly align sequences containing millions of nucleotides and give sufficient biological information. | en_US |
| dc.identifier.uri | https://uilspace.unilorin.edu.ng/handle/20.500.12484/10072 | |
| dc.language.iso | en | en_US |
| dc.publisher | ABACUS. Published by Mathematics Association of Nigeria. | en_US |
| dc.relation.ispartofseries | 35;2 | |
| dc.title | Concept of strings and Trees in Bioinformatics | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Concept of Strings and Trees in Bioinformatics.pdf
- Size:
- 9.34 MB
- Format:
- Adobe Portable Document Format
- Description:
- Main Article
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: