Scholars Central

Conference abstractPublished 8 Apr 2013

Application of particle swarm optimization for the longest common subsequence problem

Authors: Ali Teoman Unay, Meral Guzey

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

We are proposing a novel approach to solve the longest common subsequence problem, which is a common computer science problem in the field of bioinformatics and application like diff. We are using particle swarm optimization heuristic technique, and a novel occurence listing technique for evaluating solutions. The occurence listing technique will be introduced in this study. This technique aims to keep lists of the sequence elements that offers criterias to evaluate randomly generated population of sequences. Our conclusion is the application of this novel technique works on the general case problems, which have an arbitrary number of input sequences.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

More from this journal

The newest in Metabolomics:Open Access.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalMetabolomics:Open Access
  • SubjectBiochemistry & Biotechnology
  • BylineArticles whose byline prints “Ali Teoman Unay”
  • BylineArticles whose byline prints “Meral Guzey”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels