Name
Abstract | ||
|---|---|---|
Transposable genetic elements are prevalent across many living organisms from bacteria to large mammals. Given the linear primary structure of genetic material, this process is natural to study from a theoretical perspective using formal language theory. We abstract the process of genetic transposition to operations on languages and study it combinatorially and computationally. It is shown that the power of such systems is large relative to the classic Chomsky Hierarchy. However, we are still able to algorithmically determine whether or not a string is a possible product of the iterated application of the operations. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s11047-010-9207-z | Natural Computing |
Keywords | Field | DocType |
Bioinformatics,Transposable elements,Transpositions,Formal language theory,Mathematical modelling | Formal language,Chomsky hierarchy,Algorithm,Theoretical computer science,Artificial intelligence,Iterated function,Mathematics,Machine learning | Journal |
Volume | Issue | ISSN |
10 | 2 | 1567-7818 |
Citations | PageRank | References |
1 | 0.37 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark Daley | 1 | 166 | 22.18 |
| Ian McQuillan | 2 | 97 | 24.72 |
| James M. McQuillan | 3 | 12 | 2.74 |
| Kalpana Mahalingam | 4 | 135 | 21.42 |