Comparative study for DNA data minimization technique on FPGA
Data minimization technique and existing DNA sequence data representation is compared and presented in this paper. The architecture of these two modules is compared and analyzed to study the complexity and performance characteristics of the system when dealing with large DNA sequences data on FPGA....
Gespeichert in:
Hauptverfasser: | , , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 767 |
---|---|
container_issue | |
container_start_page | 765 |
container_title | |
container_volume | 2 |
creator | Al Junid, Syed Abdul Mutalib Tahir, N. M. Majid, Z. A. Osman, F. N. Shariff, K. K. M. |
description | Data minimization technique and existing DNA sequence data representation is compared and presented in this paper. The architecture of these two modules is compared and analyzed to study the complexity and performance characteristics of the system when dealing with large DNA sequences data on FPGA. These two technique is designed, synthesized and simulated using Altera Quartus II version 9.1 and targeted to Altera Cyclone II FPGA EP2C35 for determine the performance and complexity characteristic when running with DNA sequences data. Simulation results presented in this paper show it effects and feasibility when dealing with DNA sequences data on FPGA platform. |
doi_str_mv | 10.1109/ICIAS.2012.6306116 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6306116</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6306116</ieee_id><sourcerecordid>6306116</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-ec2978e26aece40308e8450a4bb1154f5ba9ee226d2f23623cfe9e4684d224333</originalsourceid><addsrcrecordid>eNo1j0FLxDAUhCMiqGv_gF7yB1rzXtI0OXgo1V0LiwrufUnbV4zYdm2zwvrrt-A6l-FjYJhh7BZEAiDsfVmU-XuCAjDRUmgAfcYimxlQaZaB1Vqcs-t_MHDJomn6FLMMGAXmij0UQ7dzowv-h_gU9s2Bt8PIH19y3rjgeOd73_nfOR96Hqj-6P33nvgMy7dVfsMuWvc1UXTyBdssnzbFc7x-XZVFvo69FSGmGudJhNpRTUpIYcioVDhVVQCpatPKWSJE3WCLUqOsW7KktFENopJSLtjdX60nou1u9J0bD9vTYXkEYAVIYA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Comparative study for DNA data minimization technique on FPGA</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Al Junid, Syed Abdul Mutalib ; Tahir, N. M. ; Majid, Z. A. ; Osman, F. N. ; Shariff, K. K. M.</creator><creatorcontrib>Al Junid, Syed Abdul Mutalib ; Tahir, N. M. ; Majid, Z. A. ; Osman, F. N. ; Shariff, K. K. M.</creatorcontrib><description>Data minimization technique and existing DNA sequence data representation is compared and presented in this paper. The architecture of these two modules is compared and analyzed to study the complexity and performance characteristics of the system when dealing with large DNA sequences data on FPGA. These two technique is designed, synthesized and simulated using Altera Quartus II version 9.1 and targeted to Altera Cyclone II FPGA EP2C35 for determine the performance and complexity characteristic when running with DNA sequences data. Simulation results presented in this paper show it effects and feasibility when dealing with DNA sequences data on FPGA platform.</description><identifier>ISBN: 1457719681</identifier><identifier>ISBN: 9781457719684</identifier><identifier>EISBN: 9781457719660</identifier><identifier>EISBN: 1457719673</identifier><identifier>EISBN: 1457719665</identifier><identifier>EISBN: 9781457719677</identifier><identifier>DOI: 10.1109/ICIAS.2012.6306116</identifier><language>eng</language><publisher>IEEE</publisher><subject>Complexity theory ; Computers ; DNA ; Field programmable gate arrays ; Memory management ; Minimization</subject><ispartof>2012 4th International Conference on Intelligent and Advanced Systems (ICIAS2012), 2012, Vol.2, p.765-767</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6306116$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6306116$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Al Junid, Syed Abdul Mutalib</creatorcontrib><creatorcontrib>Tahir, N. M.</creatorcontrib><creatorcontrib>Majid, Z. A.</creatorcontrib><creatorcontrib>Osman, F. N.</creatorcontrib><creatorcontrib>Shariff, K. K. M.</creatorcontrib><title>Comparative study for DNA data minimization technique on FPGA</title><title>2012 4th International Conference on Intelligent and Advanced Systems (ICIAS2012)</title><addtitle>ICIAS</addtitle><description>Data minimization technique and existing DNA sequence data representation is compared and presented in this paper. The architecture of these two modules is compared and analyzed to study the complexity and performance characteristics of the system when dealing with large DNA sequences data on FPGA. These two technique is designed, synthesized and simulated using Altera Quartus II version 9.1 and targeted to Altera Cyclone II FPGA EP2C35 for determine the performance and complexity characteristic when running with DNA sequences data. Simulation results presented in this paper show it effects and feasibility when dealing with DNA sequences data on FPGA platform.</description><subject>Complexity theory</subject><subject>Computers</subject><subject>DNA</subject><subject>Field programmable gate arrays</subject><subject>Memory management</subject><subject>Minimization</subject><isbn>1457719681</isbn><isbn>9781457719684</isbn><isbn>9781457719660</isbn><isbn>1457719673</isbn><isbn>1457719665</isbn><isbn>9781457719677</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j0FLxDAUhCMiqGv_gF7yB1rzXtI0OXgo1V0LiwrufUnbV4zYdm2zwvrrt-A6l-FjYJhh7BZEAiDsfVmU-XuCAjDRUmgAfcYimxlQaZaB1Vqcs-t_MHDJomn6FLMMGAXmij0UQ7dzowv-h_gU9s2Bt8PIH19y3rjgeOd73_nfOR96Hqj-6P33nvgMy7dVfsMuWvc1UXTyBdssnzbFc7x-XZVFvo69FSGmGudJhNpRTUpIYcioVDhVVQCpatPKWSJE3WCLUqOsW7KktFENopJSLtjdX60nou1u9J0bD9vTYXkEYAVIYA</recordid><startdate>201206</startdate><enddate>201206</enddate><creator>Al Junid, Syed Abdul Mutalib</creator><creator>Tahir, N. M.</creator><creator>Majid, Z. A.</creator><creator>Osman, F. N.</creator><creator>Shariff, K. K. M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201206</creationdate><title>Comparative study for DNA data minimization technique on FPGA</title><author>Al Junid, Syed Abdul Mutalib ; Tahir, N. M. ; Majid, Z. A. ; Osman, F. N. ; Shariff, K. K. M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-ec2978e26aece40308e8450a4bb1154f5ba9ee226d2f23623cfe9e4684d224333</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Complexity theory</topic><topic>Computers</topic><topic>DNA</topic><topic>Field programmable gate arrays</topic><topic>Memory management</topic><topic>Minimization</topic><toplevel>online_resources</toplevel><creatorcontrib>Al Junid, Syed Abdul Mutalib</creatorcontrib><creatorcontrib>Tahir, N. M.</creatorcontrib><creatorcontrib>Majid, Z. A.</creatorcontrib><creatorcontrib>Osman, F. N.</creatorcontrib><creatorcontrib>Shariff, K. K. M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Al Junid, Syed Abdul Mutalib</au><au>Tahir, N. M.</au><au>Majid, Z. A.</au><au>Osman, F. N.</au><au>Shariff, K. K. M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Comparative study for DNA data minimization technique on FPGA</atitle><btitle>2012 4th International Conference on Intelligent and Advanced Systems (ICIAS2012)</btitle><stitle>ICIAS</stitle><date>2012-06</date><risdate>2012</risdate><volume>2</volume><spage>765</spage><epage>767</epage><pages>765-767</pages><isbn>1457719681</isbn><isbn>9781457719684</isbn><eisbn>9781457719660</eisbn><eisbn>1457719673</eisbn><eisbn>1457719665</eisbn><eisbn>9781457719677</eisbn><abstract>Data minimization technique and existing DNA sequence data representation is compared and presented in this paper. The architecture of these two modules is compared and analyzed to study the complexity and performance characteristics of the system when dealing with large DNA sequences data on FPGA. These two technique is designed, synthesized and simulated using Altera Quartus II version 9.1 and targeted to Altera Cyclone II FPGA EP2C35 for determine the performance and complexity characteristic when running with DNA sequences data. Simulation results presented in this paper show it effects and feasibility when dealing with DNA sequences data on FPGA platform.</abstract><pub>IEEE</pub><doi>10.1109/ICIAS.2012.6306116</doi><tpages>3</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 1457719681 |
ispartof | 2012 4th International Conference on Intelligent and Advanced Systems (ICIAS2012), 2012, Vol.2, p.765-767 |
issn | |
language | eng |
recordid | cdi_ieee_primary_6306116 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Complexity theory Computers DNA Field programmable gate arrays Memory management Minimization |
title | Comparative study for DNA data minimization technique on FPGA |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T10%3A17%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Comparative%20study%20for%20DNA%20data%20minimization%20technique%20on%20FPGA&rft.btitle=2012%204th%20International%20Conference%20on%20Intelligent%20and%20Advanced%20Systems%20(ICIAS2012)&rft.au=Al%20Junid,%20Syed%20Abdul%20Mutalib&rft.date=2012-06&rft.volume=2&rft.spage=765&rft.epage=767&rft.pages=765-767&rft.isbn=1457719681&rft.isbn_list=9781457719684&rft_id=info:doi/10.1109/ICIAS.2012.6306116&rft_dat=%3Cieee_6IE%3E6306116%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781457719660&rft.eisbn_list=1457719673&rft.eisbn_list=1457719665&rft.eisbn_list=9781457719677&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6306116&rfr_iscdi=true |