Pathway mapping with operon information: an integer-programming method
Biological pathway mapping is an important problem in the post-genomic era. We now present a new algorithm for pathway mapping in microbes. The algorithm considers not only sequence similarity among the template and target genes, but also the operon structures in the target genome. We formulated the...
Gespeichert in:
| Veröffentlicht in: | 2004 IEEE Computational Systems Bioinformatics Conference S. 642 - 643 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
2004
|
| Schlagworte: | |
| ISBN: | 9780769521947, 0769521940 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Biological pathway mapping is an important problem in the post-genomic era. We now present a new algorithm for pathway mapping in microbes. The algorithm considers not only sequence similarity among the template and target genes, but also the operon structures in the target genome. We formulated the mapping problem as a graph finding problem, and solved it by an integer-programming (IP) method. The goal is to minimize a linear object function subject to six constraints, such that maximal sequence similarity among the template and target genes are achieved, and at the same time, a minimal number of operons are covered in the target genome. Compared to our previous minimal spanning tree (MST) algorithm, the IP method has the following advantages: i) It is much faster and thus can map larger pathway involving a much large set of genes. ii) The IP method looks into the details of genes in the operons, and consequently avoids the many-to-one mapping mistakes that sometimes occur in the MST algorithm. We have compiled a large pathway training set to optimize the parameters of the program, and tested it by mapping 16 complex pathways from BioCyc onto E.coli K12 genome and the results are very promising. |
|---|---|
| AbstractList | Biological pathway mapping is an important problem in the post-genomic era. We now present a new algorithm for pathway mapping in microbes. The algorithm considers not only sequence similarity among the template and target genes, but also the operon structures in the target genome. We formulated the mapping problem as a graph finding problem, and solved it by an integer-programming (IP) method. The goal is to minimize a linear object function subject to six constraints, such that maximal sequence similarity among the template and target genes are achieved, and at the same time, a minimal number of operons are covered in the target genome. Compared to our previous minimal spanning tree (MST) algorithm, the IP method has the following advantages: i) It is much faster and thus can map larger pathway involving a much large set of genes. ii) The IP method looks into the details of genes in the operons, and consequently avoids the many-to-one mapping mistakes that sometimes occur in the MST algorithm. We have compiled a large pathway training set to optimize the parameters of the program, and tested it by mapping 16 complex pathways from BioCyc onto E.coli K12 genome and the results are very promising. |
| Author | Ying Xu Zhengchang Su Chuang, D. Fenglou Mao Olman, V. |
| Author_xml | – sequence: 1 surname: Fenglou Mao fullname: Fenglou Mao organization: Dept. of Biochem. & Molecular Biol., Oak Ridge Nat. Lab., TN, USA – sequence: 2 givenname: V. surname: Olman fullname: Olman, V. organization: Dept. of Biochem. & Molecular Biol., Oak Ridge Nat. Lab., TN, USA – sequence: 3 surname: Ying Xu fullname: Ying Xu organization: Dept. of Biochem. & Molecular Biol., Oak Ridge Nat. Lab., TN, USA – sequence: 4 surname: Zhengchang Su fullname: Zhengchang Su organization: Dept. of Biochem. & Molecular Biol., Oak Ridge Nat. Lab., TN, USA – sequence: 5 givenname: D. surname: Chuang fullname: Chuang, D. organization: Dept. of Biochem. & Molecular Biol., Oak Ridge Nat. Lab., TN, USA |
| BookMark | eNotT0tLxDAYDKigrr0LXvoHWvNq03jT4qqwoODel6-bpI2YB2lg2X9vF3cuw8DMMHOLLn3wGqF7gmtCsHzsv19qijGvCWO0od0FKqTosGhlQ4nk4hoV8_yDF_CGE9HcoPUX5OkAx9JBjNaP5cHmqQxRp-BL601IDrIN_qmEk8561KmKKYwJnDv5nc5TUHfoysDvrIszr9B2_brt36vN59tH_7yprMS5EkRxhSXmVGowLVdmIBRgAGAYDB2At2RP6DJOdZSpDgNR-xaWEGukMJSt0MN_rdVa72KyDtJxdz7L_gBU9Ey5 |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/CSB.2004.1332528 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EndPage | 643 |
| ExternalDocumentID | 1332528 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IK 6IL AAJGR AAVQY AAWTH ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK OCL RIB RIC RIE RIL |
| ID | FETCH-LOGICAL-i90t-71d4d090429eaf64dfb12aabaa30af2ba461c12045d823d80a1dc6ad4d3597f23 |
| IEDL.DBID | RIE |
| ISBN | 9780769521947 0769521940 |
| IngestDate | Tue Aug 26 16:53:52 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i90t-71d4d090429eaf64dfb12aabaa30af2ba461c12045d823d80a1dc6ad4d3597f23 |
| PageCount | 2 |
| ParticipantIDs | ieee_primary_1332528 |
| PublicationCentury | 2000 |
| PublicationDate | 20040000 |
| PublicationDateYYYYMMDD | 2004-01-01 |
| PublicationDate_xml | – year: 2004 text: 20040000 |
| PublicationDecade | 2000 |
| PublicationTitle | 2004 IEEE Computational Systems Bioinformatics Conference |
| PublicationTitleAbbrev | CSB |
| PublicationYear | 2004 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0000454175 |
| Score | 1.326186 |
| Snippet | Biological pathway mapping is an important problem in the post-genomic era. We now present a new algorithm for pathway mapping in microbes. The algorithm... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 642 |
| SubjectTerms | Biochemistry Bioinformatics Computational biology Computational systems biology Genomics Laboratories Phylogeny Robustness Sequences Testing |
| Title | Pathway mapping with operon information: an integer-programming method |
| URI | https://ieeexplore.ieee.org/document/1332528 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED21FQMToBbxrQyMpLUTx7EZqYiYqkp06FZdYht1aIpKCuLfk3NCEBILWxwllhMPz-_d3TuAW6WsymN0YWxkEorUmVA56UIhUuaIjznDfLOJdDZTy6We9-Cuq4Wx1vrkMzumSx_LN9tiT1LZpOZTURKpPvTTVDa1Wp2eQlZyNRQ2zFzXoKRFa-nUjdPvMCXTk-nzgyeH43bOX81VPLZkR_9b1TGMfor0gnkHPyfQs-UQsnl9ovvAz2CDZLzwEpDOGmzJDbwMWpNU2or7AGlcWdL02hytDT3fdJQewSJ7XEyfwrZVQrjWrApTboRhmsDFopPCuJxHiDlizNBFOQrJC07O80ZFsVEMuSkk1i_FNaFwUXwKg3Jb2jMI6ITHfcBVW6GMVDwxhTYRaoYJiuIchvQLVq-NGcaq_fqLv29fwmGT6kKaxRUMqt3eXsNB8V6t33Y3fge_AECpmPs |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED2VggQToBbxTQZG0jqOk9iMVFRFlKoSHbpVl9hGHZqgkoL49-SSEITEwhZHieXEw_N7d_cO4FpKI2MfrevrMHBFZLUrbWhdISJmiY9ZzcpmE9FkIudzNW3BTVMLY4wpk89Mjy7LWL7Okg1JZf2CT_GAyy3YDoTgrKrWahQVMpMrwLDi5qqAJSVqU6dmHH0HKpnqD57vSnrYq2f91V6lRJfh_v_WdQDdnzI9Z9oA0CG0TNqB4bQ4033gp7NCsl54cUhpdTLyA0-d2iaVNuPWQRrnhlS9OktrRc9XPaW7MBvezwYjt26W4C4Vy93I00IzRfBi0IZC29jjiDGiz9DyGEXoJR55z2vJfS0ZejoJsXjJLyiF5f4RtNMsNcfg0BnPK0OuygipQ-kFOlGao2IYoEhOoEO_YPFa2WEs6q8__fv2FeyOZk_jxfhh8ngGe1XiCykY59DO1xtzATvJe758W1-Wu_kFawGcQg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2004+IEEE+Computational+Systems+Bioinformatics+Conference&rft.atitle=Pathway+mapping+with+operon+information%3A+an+integer-programming+method&rft.au=Fenglou+Mao&rft.au=Olman%2C+V.&rft.au=Ying+Xu&rft.au=Zhengchang+Su&rft.date=2004-01-01&rft.pub=IEEE&rft.isbn=9780769521947&rft.spage=642&rft.epage=643&rft_id=info:doi/10.1109%2FCSB.2004.1332528&rft.externalDocID=1332528 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769521947/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769521947/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769521947/sc.gif&client=summon&freeimage=true |