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

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 signi...

Full description

Bibliographic Details
Main Author: Mohammad Abu-Hashem, Muhannad Abdul-Qader
Format: Thesis
Language:English
Published: 2015
Subjects:
Online Access:http://eprints.usm.my/30172/1/Muhannad.pdf
_version_ 1797008446011211776
author Mohammad Abu-Hashem, Muhannad Abdul-Qader
author_facet Mohammad Abu-Hashem, Muhannad Abdul-Qader
author_sort Mohammad Abu-Hashem, Muhannad Abdul-Qader
collection USM
description 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.
first_indexed 2024-03-06T14:51:36Z
format Thesis
id usm.eprints-30172
institution Universiti Sains Malaysia
language English
last_indexed 2024-03-06T14:51:36Z
publishDate 2015
record_format dspace
spelling usm.eprints-301722019-04-12T05:25:49Z http://eprints.usm.my/30172/ Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data Mohammad Abu-Hashem, Muhannad Abdul-Qader QA75.5-76.95 Electronic computers. Computer science 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. 2015-02 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/30172/1/Muhannad.pdf 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.
spellingShingle QA75.5-76.95 Electronic computers. Computer science
Mohammad Abu-Hashem, Muhannad Abdul-Qader
Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data
title Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data
title_full Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data
title_fullStr Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data
title_full_unstemmed Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data
title_short Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data
title_sort filtered distance matrix for constructing high throughput multiple sequence alignment on protein data
topic QA75.5-76.95 Electronic computers. Computer science
url http://eprints.usm.my/30172/1/Muhannad.pdf
work_keys_str_mv AT mohammadabuhashemmuhannadabdulqader filtereddistancematrixforconstructinghighthroughputmultiplesequencealignmentonproteindata