A Modified Algorithm for Sequence Alignment Using Ant Colony System
In this study, we use the Ant Colony System (ACS) to develop a heuristic algorithm for sequence alignment. This algorithm is certainly an improvement on ACS-MultiAlignment, which was proposed in 2005 for predicting major histocompatibility complex (MHC) class II binders. The numerical experiments in...
Gespeichert in:
| Veröffentlicht in: | Information and Media Technologies 2009, Vol.4(4), pp.769-779 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 779 |
|---|---|
| container_issue | 4 |
| container_start_page | 769 |
| container_title | Information and Media Technologies |
| container_volume | 4 |
| creator | Mikami, Ai Shi, Jianming |
| description | In this study, we use the Ant Colony System (ACS) to develop a heuristic algorithm for sequence alignment. This algorithm is certainly an improvement on ACS-MultiAlignment, which was proposed in 2005 for predicting major histocompatibility complex (MHC) class II binders. The numerical experiments indicate that this algorithm is as much as 2, 900 times faster than the original ACS-MultiAlignment algorithm. We also compare this algorithm to the other approaches such as Gibbs sampling algorithm using numerical experiments. The results show that our algorithm finds the best value prompter than Gibbs approach. |
| doi_str_mv | 10.11185/imt.4.769 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_jstag</sourceid><recordid>TN_cdi_proquest_journals_1440074361</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3092493161</sourcerecordid><originalsourceid>FETCH-LOGICAL-j2491-121402a4b9fcc3fcc2912accf7145005f22ae46b2fe308f83a3cfdeef631895b3</originalsourceid><addsrcrecordid>eNo9UE1rwzAMNYPBStfLfoFh53SW7STOYYcQ9gUdO3Q9G8e1U4ck7uz00H8_j5ZJCInH40l6CD0AWQOAyJ_cOK_5uiyqG7QAISAjoiru0CrGnvxFSaAsF6ip8affO-vMHtdD54ObDyO2PuCt-TmZSZsEu24azTTjXXRTh-s0NX7w0xlvz3E24z26tWqIZnXtS7R7fflu3rPN19tHU2-ynvIKMqDACVW8razWLBWtgCqtbQk8JyS3lCrDi5Zaw4iwgimm7d4YWzAQVd6yJXq86B6DT7fFWfb-FKa0UgLn6SXOCkis5wurj7PqjDwGN6pwlirMTg9GJmMkv2ay5x_XBxWkmdgvnPtgeg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1440074361</pqid></control><display><type>article</type><title>A Modified Algorithm for Sequence Alignment Using Ant Colony System</title><source>J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Mikami, Ai ; Shi, Jianming</creator><creatorcontrib>Mikami, Ai ; Shi, Jianming</creatorcontrib><description>In this study, we use the Ant Colony System (ACS) to develop a heuristic algorithm for sequence alignment. This algorithm is certainly an improvement on ACS-MultiAlignment, which was proposed in 2005 for predicting major histocompatibility complex (MHC) class II binders. The numerical experiments indicate that this algorithm is as much as 2, 900 times faster than the original ACS-MultiAlignment algorithm. We also compare this algorithm to the other approaches such as Gibbs sampling algorithm using numerical experiments. The results show that our algorithm finds the best value prompter than Gibbs approach.</description><identifier>EISSN: 1881-0896</identifier><identifier>DOI: 10.11185/imt.4.769</identifier><language>eng</language><publisher>Tokyo: Information and Media Technologies Editorial Board</publisher><ispartof>Information and Media Technologies, 2009, Vol.4(4), pp.769-779</ispartof><rights>2009 by Information Processing Society of Japan</rights><rights>Copyright Japan Science and Technology Agency 2009</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,1877,4010,27900,27901,27902</link.rule.ids></links><search><creatorcontrib>Mikami, Ai</creatorcontrib><creatorcontrib>Shi, Jianming</creatorcontrib><title>A Modified Algorithm for Sequence Alignment Using Ant Colony System</title><title>Information and Media Technologies</title><addtitle>IMT</addtitle><description>In this study, we use the Ant Colony System (ACS) to develop a heuristic algorithm for sequence alignment. This algorithm is certainly an improvement on ACS-MultiAlignment, which was proposed in 2005 for predicting major histocompatibility complex (MHC) class II binders. The numerical experiments indicate that this algorithm is as much as 2, 900 times faster than the original ACS-MultiAlignment algorithm. We also compare this algorithm to the other approaches such as Gibbs sampling algorithm using numerical experiments. The results show that our algorithm finds the best value prompter than Gibbs approach.</description><issn>1881-0896</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNo9UE1rwzAMNYPBStfLfoFh53SW7STOYYcQ9gUdO3Q9G8e1U4ck7uz00H8_j5ZJCInH40l6CD0AWQOAyJ_cOK_5uiyqG7QAISAjoiru0CrGnvxFSaAsF6ip8affO-vMHtdD54ObDyO2PuCt-TmZSZsEu24azTTjXXRTh-s0NX7w0xlvz3E24z26tWqIZnXtS7R7fflu3rPN19tHU2-ynvIKMqDACVW8razWLBWtgCqtbQk8JyS3lCrDi5Zaw4iwgimm7d4YWzAQVd6yJXq86B6DT7fFWfb-FKa0UgLn6SXOCkis5wurj7PqjDwGN6pwlirMTg9GJmMkv2ay5x_XBxWkmdgvnPtgeg</recordid><startdate>2009</startdate><enddate>2009</enddate><creator>Mikami, Ai</creator><creator>Shi, Jianming</creator><general>Information and Media Technologies Editorial Board</general><general>Japan Science and Technology Agency</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2009</creationdate><title>A Modified Algorithm for Sequence Alignment Using Ant Colony System</title><author>Mikami, Ai ; Shi, Jianming</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-j2491-121402a4b9fcc3fcc2912accf7145005f22ae46b2fe308f83a3cfdeef631895b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Mikami, Ai</creatorcontrib><creatorcontrib>Shi, Jianming</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information and Media Technologies</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mikami, Ai</au><au>Shi, Jianming</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Modified Algorithm for Sequence Alignment Using Ant Colony System</atitle><jtitle>Information and Media Technologies</jtitle><addtitle>IMT</addtitle><date>2009</date><risdate>2009</risdate><volume>4</volume><issue>4</issue><spage>769</spage><epage>779</epage><pages>769-779</pages><eissn>1881-0896</eissn><abstract>In this study, we use the Ant Colony System (ACS) to develop a heuristic algorithm for sequence alignment. This algorithm is certainly an improvement on ACS-MultiAlignment, which was proposed in 2005 for predicting major histocompatibility complex (MHC) class II binders. The numerical experiments indicate that this algorithm is as much as 2, 900 times faster than the original ACS-MultiAlignment algorithm. We also compare this algorithm to the other approaches such as Gibbs sampling algorithm using numerical experiments. The results show that our algorithm finds the best value prompter than Gibbs approach.</abstract><cop>Tokyo</cop><pub>Information and Media Technologies Editorial Board</pub><doi>10.11185/imt.4.769</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 1881-0896 |
| ispartof | Information and Media Technologies, 2009, Vol.4(4), pp.769-779 |
| issn | 1881-0896 |
| language | eng |
| recordid | cdi_proquest_journals_1440074361 |
| source | J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese; EZB-FREE-00999 freely available EZB journals |
| title | A Modified Algorithm for Sequence Alignment Using Ant Colony System |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T10%3A34%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_jstag&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Modified%20Algorithm%20for%20Sequence%20Alignment%20Using%20Ant%20Colony%20System&rft.jtitle=Information%20and%20Media%20Technologies&rft.au=Mikami,%20Ai&rft.date=2009&rft.volume=4&rft.issue=4&rft.spage=769&rft.epage=779&rft.pages=769-779&rft.eissn=1881-0896&rft_id=info:doi/10.11185/imt.4.769&rft_dat=%3Cproquest_jstag%3E3092493161%3C/proquest_jstag%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1440074361&rft_id=info:pmid/&rfr_iscdi=true |