Abstract

Biological sequence alignment is one of the crucial tasks of computational bioinformatics, and provides base for other tasks of bioinformatics. In this paper, we discuss two different approaches to sequence matching – Boolean algebra and fuzzy logic. First method is a two-valued logic whereas the second is a multi-valued logic. Both the methods perform sequence matching by direct comparison method using the operations of Boolean algebra and fuzzy logic respectively. To ensure the optimal alignment, dynamic programming is employed to align the sequences progressively. Both the methods are implemented and then tested on few sets of real biological sequences taken from NCBI bank and their performances are compared with the CLUSTALW algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.