Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi

This paper presents the Design and Analysis of DNA Fragment Assembly's Converter and Checker Modules using De Bruijin Graph. There are several objectives of this paper. The first objective is to design and analyze edges and vertices converter. Secondly, this paper will also discuss about design...

Full description

Saved in:
Bibliographic Details
Main Author: Mohd Helmi, Mohd Shafiq
Format: Article
Language:English
Published: 2012
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/84775/1/84775.PDF
https://ir.uitm.edu.my/id/eprint/84775/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uitm.ir.84775
record_format eprints
spelling my.uitm.ir.847752024-11-26T08:05:35Z https://ir.uitm.edu.my/id/eprint/84775/ Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi Mohd Helmi, Mohd Shafiq Computer networks. General works. Traffic monitoring This paper presents the Design and Analysis of DNA Fragment Assembly's Converter and Checker Modules using De Bruijin Graph. There are several objectives of this paper. The first objective is to design and analyze edges and vertices converter. Secondly, this paper will also discuss about designing and analyzing common edge and branch checker. In addition, all the modules will be integrated in one top module. Lastly, the integrated module will be simulated in Xilinx ISE software. Based on the objectives, this paper will discuss on constructing a DNA Fragment Assembly module that consist of four submodules which is Edges Converter, Vertices Converter, Common Edge Checker and Branch Checker. The sequencing method used in this paper is Hybridization method. Hybridization method is an option toshotgun sequencing. Hybridization uses the array identifying algorithm to identify the sequence. The algorithm used to construct the module is Bruijn Graph. De Bruijn Graph represents sequences of symbols from an alphabet, and edges that indicate where the sequence may overlap. First, the set of DNA will inserted in to the module, then the module will do all the converting and checking process of the input before produce the output of vertices and the branch of edges. All the algorithm and theory then been simulated in Xilinx to test the functionality. 2012 Article PeerReviewed text en https://ir.uitm.edu.my/id/eprint/84775/1/84775.PDF Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi. (2012) pp. 1-6.
institution Universiti Teknologi Mara
building Tun Abdul Razak Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
url_provider http://ir.uitm.edu.my/
language English
topic Computer networks. General works. Traffic monitoring
spellingShingle Computer networks. General works. Traffic monitoring
Mohd Helmi, Mohd Shafiq
Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi
description This paper presents the Design and Analysis of DNA Fragment Assembly's Converter and Checker Modules using De Bruijin Graph. There are several objectives of this paper. The first objective is to design and analyze edges and vertices converter. Secondly, this paper will also discuss about designing and analyzing common edge and branch checker. In addition, all the modules will be integrated in one top module. Lastly, the integrated module will be simulated in Xilinx ISE software. Based on the objectives, this paper will discuss on constructing a DNA Fragment Assembly module that consist of four submodules which is Edges Converter, Vertices Converter, Common Edge Checker and Branch Checker. The sequencing method used in this paper is Hybridization method. Hybridization method is an option toshotgun sequencing. Hybridization uses the array identifying algorithm to identify the sequence. The algorithm used to construct the module is Bruijn Graph. De Bruijn Graph represents sequences of symbols from an alphabet, and edges that indicate where the sequence may overlap. First, the set of DNA will inserted in to the module, then the module will do all the converting and checking process of the input before produce the output of vertices and the branch of edges. All the algorithm and theory then been simulated in Xilinx to test the functionality.
format Article
author Mohd Helmi, Mohd Shafiq
author_facet Mohd Helmi, Mohd Shafiq
author_sort Mohd Helmi, Mohd Shafiq
title Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi
title_short Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi
title_full Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi
title_fullStr Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi
title_full_unstemmed Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi
title_sort design and analysis of dna fragment assembly's converter and checker modules using de bruijin graph : article / mohd shafiq mohd helmi
publishDate 2012
url https://ir.uitm.edu.my/id/eprint/84775/1/84775.PDF
https://ir.uitm.edu.my/id/eprint/84775/
_version_ 1817847179855790080
score 13.222552