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

Browsing by Author "Rahman, H.M. Amio"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Thumbnail Image
    Item
    Motif Finding Using Non-Deterministic Finite Automata
    (Department of Computer Science and Engineering, Islamic University of Technology, Gazipur, Bangladesh, 2015-11-15) Tapos, Touhidul Alam; Rahman, H.M. Amio
    Motif Finding is one of the topmost concerns on the basis of characteristics of the species and its primary concept is finding the common DNA sequence that specifies a certain characteristics of a species. In this thesis, here we propose a methodology of finding method using an algorithm called nondeterministic finite automata. Our primary concern is finding the best common sequence that follows the pattern and gives an accurate result with minimization of errors. And following that solving complexity issue that occurs in automaton system, we try to minimize the system time and space complexity so that it can find pattern with less storage needed. Using nondeterministic approach so far we provided a better solution approach with patterns both in matched and gapped situation.

© Open Research Bangladesh

  • Privacy policy
  • End User Agreement
  • Send Feedback