An Algorithm for alignment-free sequence comparison using Logical Match

This paper proposes an algorithm for alignment-free sequence comparison using Logical Match. Here, we compute the score using fuzzy membership values which generate automatically from the number of matches and mismatches. We demonstrate the method with both the artificial and real datum. The results show the uniqueness of the method by analyzing DNA sequences taken from NCBI databank.

• Publication year

  2010

• Venue

  International Conference on Computer and Automation Engineering

• Publication date

  2010-04-19

• Fields of study

  Biology, Computer Science

• Identifiers
  DOI 10.1109/ICCAE.2010.5452072arXiv 1407.2237
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Alignment-free sequence comparison-a review

  2003cited by this paper
• Fuzzy Models and Algorithms for Pattern Recognition and Image Processing

  1999influential reference
• An overview of membership function generation techniques for pattern recognition

  1998influential reference
• Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology

  1997cited by this paper
• Membership function as an evaluation

  1990influential reference
• A model for the measurement of membership and the consequences of its empirical implementation

  1984cited by this paper
• A fast string searching algorithm

  1977cited by this paper
• Fast Pattern Matching in Strings

  1977cited by this paper
• Efficient string matching

  1975cited by this paper

• Analysis of DNA Sequence Pattern Matching: A Brief Survey

  2021cites this paper
• Sequential data mining using correlation matrix memory

  2010cites this paper