A fast fuzzy Cocke-Younger-Kasami algorithm for DNA and RNA strings analysis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper we present a variation of the Cocke-Younger-Kasami algorithm (CYK algorithm for short) for the analysis of fuzzy free context languages applied to DNA strings. We propose a variation of the original CYK algorithm where we prove that the order of the new CYK algorithm is O(n). We prove that the new algorithm only use 2n-1 memory localities. We use a variation of the CYK algorithm, where the free context language can be fuzzy. The fuzzy context-free grammar (FCFG) is obtained from DNA and RNA sequences.

Original languageEnglish
Title of host publicationAdvances in Soft Computing - 9th Mexican International Conference on Artificial Intelligence, MICAI 2010, Proceedings
Pages80-91
Number of pages12
EditionPART 2
DOIs
StatePublished - 2010
Event9th Mexican International Conference on Artificial Intelligence, MICAI 2010 - Pachuca, Mexico
Duration: 8 Nov 201013 Nov 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6438 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th Mexican International Conference on Artificial Intelligence, MICAI 2010
Country/TerritoryMexico
CityPachuca
Period8/11/1013/11/10

Keywords

  • ADN
  • Cocke-Younger-Kasami algorithm
  • Pattern recognition
  • RNA
  • fuzzy logic

Fingerprint

Dive into the research topics of 'A fast fuzzy Cocke-Younger-Kasami algorithm for DNA and RNA strings analysis'. Together they form a unique fingerprint.

Cite this