Solution to Motif Finding Problem in Membranes

详细信息    查看全文

• 关键词：Membrane computing ; Evolution ; communication P systems with energy ; Motif finding
• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10105
• 期：1
• 页码：190-208
• 丛书名：Membrane Computing
• ISBN：978-3-319-54072-6
• 卷排序：10105

文摘

The study of genes is an important field of biology. A way to understand genetic composition is through finding regularly occurring nucleotide sequences, or motifs, in a DNA sequence. However, finding these motifs is difficult and is shown to be NP-complete. In this paper, we use a variant of P systems called Evolution-Communication P systems with Energy using string objects to solve the Motif Finding Problem in O(lt)-time where l is the length of the motif and t is the number of DNA sequences given.