PQ trees, consecutive ones problem and applications

  • OO Olugbenga
  • EF Adebiyi
  • S Fatumo
  • A Dawodu
Keywords: PQ trees, Consecutive ones problem, bioinformatics, computer science

Abstract

A PQ tree is an advanced tree–based data structure, which represents a family of permutations on a set of elements. In this research article, we considered the significance of PQ trees and the Consecutive ones Problem to Computer Science and bioinformatics and their various applications. We also went further to demonstrate the operations of the characteristics of the Consecutive ones property by simulation, using high level programming languages. Attempt was also made at developing a PQ tree–Consecutive Ones analyzer, which could be instrumental not only as an educative tool to inquisitive students, but also serve as an important tool in developing clustering software in the field of bioinformatics and other application domains, with respect to solving real life problems.

Keywords: PQ trees, Consecutive ones problem, bioinformatics, computer science

Section
Articles

Journal Identifiers


eISSN: 0794-4713