Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: biological sequences

Sortuj według:

Ogranicz wyniki do:

Minimal state automata for detecting a β globin gene mutation

Ferdania Devi Fitri, Irawati, Garminia Hanni, Akhmaloka, Rachmansyah Kemal Aziez

International Journal of Applied Mathematics and Computer Science

2021

Vol. 31, no. 2

337--351

Beta-thalassemia is an autosomal recessive blood disorder characterized by abnormalities in the synthesis of β globin. Together with α globin, it is a subunit of globin protein, called hemoglobin, located inside our red blood cells to deliver oxygen from the lungs to all of the tissues throughout our body. Thereby, individuals with β-thalassemia will often feel limp due to a lack of oxygen dissolved in their blood. In this paper, a finite state automaton to detect and classify β globin gene mutations using its DNA sequence is constructed. Finite state automata have a close connection to an algebraic structure, that is, a monoid. Together with the theory of the syntactic monoid, we present a methodology to minimize the number of the internal states of an automaton to have minimal state automata. Therefore, a minimal state automaton can be constructed to detect β globin gene mutation causing the β-thalassemia disease. We have developed a MATLAB program to conduct the appropriate simulations.

Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences

Iliopoulos C.S., Smyth W.F., Yusufu M.

Fundamenta Informaticae

2009

Vol. 97, nr 3

311-320

A repeat in a string is a substring that occurs more than once. A repeat is extendible if every occurrence of the repeat has an identical letter either on the left or on the right; otherwise, it is maximal. A multirepeat is a repeat that occurs at least mmin times (mmin