Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Gbadeyan, J. A."

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • Item
    Concept of strings and Trees in Bioinformatics
    (ABACUS. Published by Mathematics Association of Nigeria., 2008) Oladele, Tinuke Omolewa; Bamigbola, O. M.; Gbadeyan, J. A.
    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.

University of Ilorin Library © 2024, All Right Reserved

  • Cookie settings
  • Send Feedback
  • with ❤ from dspace.ng