Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data

Mohammad Abu-Hashem, Muhannad Abdul-Qader (2015) Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data. PhD thesis, Universiti Sains Malaysia.

[img]
Preview
 PDF
Download (928kB) | Preview

Abstract

Urutan Penjajaran Berganda (MSA) adalah satu proses yang penting dalam biologi pengkomputeran dan bioinformatik. MSA optima adalah masalah NP-keras sementara membina penjajaran optimum menggunakan pengaturcaraan dinamik merupakan masalah NP lengkap. Multiple sequence alignment (MSA) is a significant process in computational biology and bioinformatics. Optimal MSA is an NP-hard problem, while building optimal alignment using dynamic programming is an NP complete problem. Although numerous algorithms have been proposed for MSA, producing an efficient MSA with high accuracy remains a huge challenge.

Item Type: Thesis (PhD)
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Pusat Pengajian Sains Komputer (School of Computer Sciences) > Thesis
Depositing User: Mr Firdaus Mohamad
Date Deposited: 21 Jul 2016 04:15
Last Modified: 12 Apr 2019 05:25
URI: http://eprints.usm.my/id/eprint/30172

Actions (login required)

View Item View Item
USM Repository is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.
Share