The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches
The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tre...
Uloženo v:
| Vydáno v: | IEEE/ACM transactions on computational biology and bioinformatics Ročník 6; číslo 2; s. 221 - 231 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
United States
IEEE
01.04.2009
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1545-5963, 1557-9964, 1557-9964 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the NNI search problem, which is based on the nearest neighbor interchange operation. In this work, we 1) provide a novel near-linear time algorithm for the NNI search problem, 2) introduce extensions that significantly enlarge the search space of the NNI search problem, and 3) present algorithms for these extended versions that are asymptotically just as efficient as our algorithm for the NNI search problem. The exceptional speedup achieved in the extended NNI search problems makes the gene-duplication problem more tractable for large-scale phylogenetic analyses. We verify the performance of our algorithms in a comparison study using sets of large randomly generated gene trees. |
|---|---|
| AbstractList | The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the NNI search problem, which is based on the nearest neighbor interchange operation. In this work, we 1) provide a novel near-linear time algorithm for the NNI search problem, 2) introduce extensions that significantly enlarge the search space of the NNI search problem, and 3) present algorithms for these extended versions that are asymptotically just as efficient as our algorithm for the NNI search problem. The exceptional speedup achieved in the extended NNI search problems makes the gene-duplication problem more tractable for large-scale phylogenetic analyses. We verify the performance of our algorithms in a comparison study using sets of large randomly generated gene trees. The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the {\tt NNI} search problem, which is based on the nearest neighbor interchange operation. In this work, we 1) provide a novel near-linear time algorithm for the {\tt NNI} search problem, 2) introduce extensions that significantly enlarge the search space of the {\tt NNI} search problem, and 3) present algorithms for these extended versions that are asymptotically just as efficient as our algorithm for the {\tt NNI} search problem. The exceptional speedup achieved in the extended {\tt NNI} search problems makes the gene-duplication problem more tractable for large-scale phylogenetic analyses. We verify the performance of our algorithms in a comparison study using sets of large randomly generated gene trees. The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the {\tt NNI} search problem, which is based on the nearest neighbor interchange operation. In this work, we 1) provide a novel near-linear time algorithm for the {\tt NNI} search problem, 2) introduce extensions that significantly enlarge the search space of the {\tt NNI} search problem, and 3) present algorithms for these extended versions that are asymptotically just as efficient as our algorithm for the {\tt NNI} search problem. The exceptional speedup achieved in the extended {\tt NNI} search problems makes the gene-duplication problem more tractable for large-scale phylogenetic analyses. We verify the performance of our algorithms in a comparison study using sets of large randomly generated gene trees.The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the {\tt NNI} search problem, which is based on the nearest neighbor interchange operation. In this work, we 1) provide a novel near-linear time algorithm for the {\tt NNI} search problem, 2) introduce extensions that significantly enlarge the search space of the {\tt NNI} search problem, and 3) present algorithms for these extended versions that are asymptotically just as efficient as our algorithm for the {\tt NNI} search problem. The exceptional speedup achieved in the extended {\tt NNI} search problems makes the gene-duplication problem more tractable for large-scale phylogenetic analyses. We verify the performance of our algorithms in a comparison study using sets of large randomly generated gene trees. In this work, we 1 provide a novel near-linear time algorithm for the NNI search problem, 2 introduce extensions that significantly enlarge the search space of the NNI search problem, and 3 present algorithms for these extended versions that are asymptotically just as efficient as our algorithm for the NNI search problem. |
| Author | Bansal, M.S. Eulenstein, O. Wehe, A. |
| Author_xml | – sequence: 1 givenname: M.S. surname: Bansal fullname: Bansal, M.S. organization: Dept. of Comput. Sci., Iowa State Univ., Ames, IA – sequence: 2 givenname: O. surname: Eulenstein fullname: Eulenstein, O. organization: Dept. of Comput. Sci., Iowa State Univ., Ames, IA – sequence: 3 givenname: A. surname: Wehe fullname: Wehe, A. organization: Dept. of Comput. Sci., Iowa State Univ., Ames, IA |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/19407347$$D View this record in MEDLINE/PubMed |
| BookMark | eNqF0ktv1DAQAGALFdEHnDgioYgDIKEsYzuJY27dBUql1YLEwtVynDHrKokXOzn039dhSw8VKqexrG9GY8-ckqPBD0jIcwoLSkG-366WywUDkAvxiJzQshS5lFVxNJ-LMi9lxY_JaYxXAKyQUDwhx1QWIHghTsjP7Q6zCxww_zjtO2f06PyQfQu-6bD_kG1Qh3zthhSyresxO-9--eDGXR8z60O22VzmSx2xzdbe6C77nqDZYXxKHlvdRXx2G8_Ij8-ftqsv-frrxeXqfJ2bgsOYl7pFTVtoGmDccgscDZbSVLI1rJTWGmwKZprW1g2iaGVjLWPpmksAoYGfkTeHuvvgf08YR9W7aLDr9IB-iqquZFmzmsskXz8oK0ElSPF_yCjltGIzfPsgpKkkq6EWItFX9-iVn8KQfiZ1SEXJBMxveXmLpqbHVu2D63W4Vn-HlQA9ABN8jAGtMm78M7AxaNcpCmpeCDUvhJoXQs057-7l3JX9p35x0A4R72QhUnuS8Rsly7z- |
| CODEN | ITCBCY |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2014_02_025 crossref_primary_10_1089_cmb_2014_0021 crossref_primary_10_1109_TCBB_2012_162 crossref_primary_10_1109_TCBB_2010_74 crossref_primary_10_1109_TCBB_2011_64 crossref_primary_10_1186_1748_7188_5_18 crossref_primary_10_1186_1471_2105_11_S1_S42 crossref_primary_10_1109_TCBB_2013_103 |
| Cites_doi | 10.1137/S0097539798343362 10.1089/cmb.1997.4.177 10.1093/bioinformatics/btm193 10.1006/mpev.1996.0390 10.1142/9789812799623_0050 10.1093/bioinformatics/btn230 10.1006/mpev.1997.0434 10.1093/bioinformatics/14.9.819 10.1007/978-3-540-79450-9_3 10.1186/1471-2148-7-S1-S3 10.1007/3-540-48447-7_29 10.1007/978-3-540-71681-5_17 10.1093/oso/9780198509424.001.0001 10.2307/2412519 10.1016/j.tcs.2005.05.016 10.1007/3-540-68530-8_9 10.1007/978-3-540-32290-0_4 10.1177/117693430600200003 10.1038/nature06107 10.1089/106652700750050871 10.1007/10719839_9 10.1007/s00026-001-8006-8 10.1007/978-1-4020-2330-9_6 10.1006/mpev.1996.0071 10.1145/974614.974657 10.1007/s00026-004-0229-z 10.1089/cmb.1995.2.493 10.2307/2413581 10.1093/bioinformatics/btg1000 10.1145/332306.332359 10.1109/TCBB.2008.69 10.1007/978-3-540-39763-2_19 10.1006/mpev.1999.0676 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009 |
| DBID | 97E RIA RIE AAYXX CITATION CGR CUY CVF ECM EIF NPM 7QF 7QO 7QQ 7SC 7SE 7SP 7SR 7TA 7TB 7U5 8BQ 8FD F28 FR3 H8D JG9 JQ2 KR7 L7M L~C L~D P64 7X8 |
| DOI | 10.1109/TCBB.2009.7 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library CrossRef Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed Aluminium Industry Abstracts Biotechnology Research Abstracts Ceramic Abstracts Computer and Information Systems Abstracts Corrosion Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts Materials Business File Mechanical & Transportation Engineering Abstracts Solid State and Superconductivity Abstracts METADEX Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database Aerospace Database Materials Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Biotechnology and BioEngineering Abstracts MEDLINE - Academic |
| DatabaseTitle | CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) Materials Research Database Civil Engineering Abstracts Aluminium Industry Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Ceramic Abstracts Materials Business File METADEX Biotechnology and BioEngineering Abstracts Computer and Information Systems Abstracts Professional Aerospace Database Engineered Materials Abstracts Biotechnology Research Abstracts Solid State and Superconductivity Abstracts Engineering Research Database Corrosion Abstracts Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering MEDLINE - Academic |
| DatabaseTitleList | Technology Research Database MEDLINE MEDLINE - Academic Engineering Research Database Materials Research Database Engineering Research Database |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 1557-9964 |
| EndPage | 231 |
| ExternalDocumentID | 2318964081 19407347 10_1109_TCBB_2009_7 4770092 |
| Genre | orig-research Research Support, U.S. Gov't, Non-P.H.S Journal Article |
| GroupedDBID | 0R~ 29I 4.4 53G 5GY 5VS 6IK 8US 97E AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACM ACPRK ADBCU ADL AEBYY AEFXT AEJOY AENEX AENSD AETIX AFRAH AFWIH AFWXC AGQYO AGSQL AHBIQ AIBXA AIKLT AKJIK AKQYR AKRVB ALMA_UNASSIGNED_HOLDINGS ASPBG ATWAV AVWKF BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 DU5 EBS EJD FEDTE GUFHI HGAVV HZ~ I07 IEDLZ IFIPE IPLJI JAVBF LAI LHSKQ M43 O9- OCL P1C P2P PQQKQ RIA RIE RNI RNS ROL RZB TN5 XOL AAYXX CITATION CGR CUY CVF ECM EIF NPM RIG 7QF 7QO 7QQ 7SC 7SE 7SP 7SR 7TA 7TB 7U5 8BQ 8FD F28 FR3 H8D JG9 JQ2 KR7 L7M L~C L~D P64 7X8 |
| ID | FETCH-LOGICAL-c430t-5adea1d0bb023f3f03ece59c69dc259ffceb42cbdf8bee7d9bff22ffc39007a03 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000265540300006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1545-5963 1557-9964 |
| IngestDate | Tue Oct 07 09:21:02 EDT 2025 Mon Sep 29 06:19:16 EDT 2025 Mon Oct 06 18:07:07 EDT 2025 Sun Sep 28 10:42:56 EDT 2025 Sun Nov 30 03:44:12 EST 2025 Mon Jul 21 05:56:36 EDT 2025 Sat Nov 29 08:08:52 EST 2025 Tue Nov 18 22:23:12 EST 2025 Tue Aug 26 16:38:04 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c430t-5adea1d0bb023f3f03ece59c69dc259ffceb42cbdf8bee7d9bff22ffc39007a03 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PMID | 19407347 |
| PQID | 861752700 |
| PQPubID | 23462 |
| PageCount | 11 |
| ParticipantIDs | proquest_journals_861752700 pubmed_primary_19407347 proquest_miscellaneous_869582839 crossref_citationtrail_10_1109_TCBB_2009_7 proquest_miscellaneous_21131629 crossref_primary_10_1109_TCBB_2009_7 proquest_miscellaneous_1671280877 ieee_primary_4770092 proquest_miscellaneous_67190979 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-04-01 |
| PublicationDateYYYYMMDD | 2009-04-01 |
| PublicationDate_xml | – month: 04 year: 2009 text: 2009-04-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States – name: New York |
| PublicationTitle | IEEE/ACM transactions on computational biology and bioinformatics |
| PublicationTitleAbbrev | TCBB |
| PublicationTitleAlternate | IEEE/ACM Trans Comput Biol Bioinform |
| PublicationYear | 2009 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref35 ref12 ref34 ref14 ref36 ref31 ref30 ref11 ref33 ref32 DasGupta (ref37) Eulenstein (ref23) 1998 ref2 ref1 ref17 ref16 ref38 ref19 ref18 Swofford (ref15) 1996 ref24 ref26 ref25 ref22 ref21 ref28 Ganapathy (ref20) ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 Felsenstein (ref10) 2004 |
| References_xml | – ident: ref8 doi: 10.1137/S0097539798343362 – ident: ref24 doi: 10.1089/cmb.1997.4.177 – ident: ref4 doi: 10.1093/bioinformatics/btm193 – start-page: 900 volume-title: Proc. Symp. Discrete Algorithms (SODA) ident: ref20 article-title: On Contract-and-Refine Transformations between Phylogenetic Trees – ident: ref14 doi: 10.1006/mpev.1996.0390 – ident: ref31 doi: 10.1142/9789812799623_0050 – ident: ref38 doi: 10.1093/bioinformatics/btn230 – ident: ref29 doi: 10.1006/mpev.1997.0434 – ident: ref9 doi: 10.1093/bioinformatics/14.9.819 – ident: ref1 doi: 10.1007/978-3-540-79450-9_3 – start-page: 427 volume-title: Proc. Symp. Discrete Algorithms (SODA) ident: ref37 article-title: On Distances between Phylogenetic Trees – ident: ref33 doi: 10.1186/1471-2148-7-S1-S3 – year: 1998 ident: ref23 article-title: Predictions of Gene-Duplications and Their Phylogenetic Development – ident: ref35 doi: 10.1007/3-540-48447-7_29 – ident: ref17 doi: 10.1007/978-3-540-71681-5_17 – ident: ref11 doi: 10.1093/oso/9780198509424.001.0001 – ident: ref2 doi: 10.2307/2412519 – ident: ref26 doi: 10.1016/j.tcs.2005.05.016 – ident: ref34 doi: 10.1007/3-540-68530-8_9 – ident: ref27 doi: 10.1007/978-3-540-32290-0_4 – ident: ref16 doi: 10.1177/117693430600200003 – ident: ref5 doi: 10.1038/nature06107 – start-page: 407 volume-title: Molecular Systematics year: 1996 ident: ref15 article-title: Phylogenetic Inference – ident: ref25 doi: 10.1089/106652700750050871 – ident: ref28 doi: 10.1007/10719839_9 – ident: ref12 doi: 10.1007/s00026-001-8006-8 – ident: ref32 doi: 10.1007/978-1-4020-2330-9_6 – ident: ref3 doi: 10.1006/mpev.1996.0071 – ident: ref7 doi: 10.1145/974614.974657 – ident: ref13 doi: 10.1007/s00026-004-0229-z – ident: ref22 doi: 10.1089/cmb.1995.2.493 – start-page: 37-46. volume-title: Inferring Phylogenies year: 2004 ident: ref10 – ident: ref21 doi: 10.2307/2413581 – ident: ref6 doi: 10.1093/bioinformatics/btg1000 – ident: ref36 doi: 10.1145/332306.332359 – ident: ref18 doi: 10.1109/TCBB.2008.69 – ident: ref19 doi: 10.1007/978-3-540-39763-2_19 – ident: ref30 doi: 10.1006/mpev.1999.0676 |
| SSID | ssj0024904 |
| Score | 1.9021552 |
| Snippet | The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene-duplication... In this work, we 1 provide a novel near-linear time algorithm for the NNI search problem, 2 introduce extensions that significantly enlarge the search space of... |
| SourceID | proquest pubmed crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 221 |
| SubjectTerms | Algorithms Animals Assembly Asymptotic properties Bioinformatics Biology Computational Biology Computational phylogenetics Evolution (biology) Gene Duplication Genes Genomics Heuristic History Large-scale systems local search Models, Genetic Nearest neighbor searches Phylogeny Search problems Searching Sequence Analysis, DNA Sequences Studies supertrees Trees tt NNI |
| Title | The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches |
| URI | https://ieeexplore.ieee.org/document/4770092 https://www.ncbi.nlm.nih.gov/pubmed/19407347 https://www.proquest.com/docview/861752700 https://www.proquest.com/docview/1671280877 https://www.proquest.com/docview/21131629 https://www.proquest.com/docview/67190979 https://www.proquest.com/docview/869582839 |
| Volume | 6 |
| WOSCitedRecordID | wos000265540300006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9964 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0024904 issn: 1545-5963 databaseCode: RIE dateStart: 20040101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB21FUhcKFA-0tJipJ4Qps6XneHWLVQgoaiHgvYWxfG4VCq7aLOLxL9nnGTTHroHTomSpyh2xpqZjOc9gGOnNMbOWWmQMpnlsZXotJfo86IJhOAp2U5swpRlMZ3ixRa8H3thiKjbfEYfwmlXy3fzZhV-lZ1kxgSOoG3YNkb3vVq3vHrYSQWGiEDmbFVDL16s8OTybDLpmSk7yT3kHCYNcip3HFGnrLI5yOyczfnu_73mE3g8BJXitLeCp7BFs2fwsJeZ_LsHP9gWROCXlp9WY7laXPRSMh9FycYuOSflgwgdIeL05mq-uF7-_NUKDmlFWX6VE3Z2TnwLjk_0O5SpfQ7fzz9fnn2Rg56CbLJULWVeO6pjp6xlR-1Tr1IKTViNRtdwFuR9QzZLGut8YYmMQ-t9kvDlFDmSqFX6AnZm8xm9AuFzzJA0kbKY6dpZh4kpKC6sy33mXQTv1pNbNQPZeNC8uKm6pENhFT5K0MDEykRwPIJ_9xwb98P2wlyPkGGaIzhYf7VqWH9tVXBgloeaegRvx7u8cEI1pJ7RfNVWsTbsmwMfYgRvNmA4O05jneBmBD8EFRpGiA2IQmMoTaYMednb1O0gB1Pcv39kB_BoXbtS8WvYWS5WdAgPmj_L63ZxxItgWhx1i-Af4_oDpQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB2VAqKX8lGgoUCN1BPCrZM4H9Nbt1C1Yol6WFBvURyPoVLZRZtdJP494ySbcugeOCVKnqLYGWtmMp73AA6sSjG01sgMSUudhEaiTZ1El-S1JwSPybRiE1lR5FdXeLkBH4ZeGCJqN5_RoT9ta_l2Vi_9r7IjnWWeI-ge3E-0jlTXrXXLrIetWKCPCWTCdtV344UKjyano1HHTdmK7iFnMbEXVPnHFbXaKuvDzNbdnD3-vxd9Att9WClOOjt4Chs0fQYPO6HJPzvwja1BeIZp-XE5FKzFZScmcywKNnfJWSkfhO8JESc332fz68WPn43goFYUxYUcsbuzYuxdn-j2KFPzHL6efZqcnsteUUHWOlYLmVSWqtAqY9hVu9ipmHwbVp2irTkPcq4mo6PaWJcbosyicS6K-HKMHEtUKn4Bm9PZlHZBuAQ1UkqkDOq0ssZilOUU5sYmTjsbwPvV5JZ1TzfuVS9uyjbtUFj6j-JVMLHMAjgYwL86lo27YTt-rgdIP80B7K2-WtmvwKbMOTRLfFU9gHfDXV46vh5STWm2bMowzdg7e0bEAPbXYDg_jsM0wvUIfggqzBgh1iDyFH1xMmbIy86mbgfZm-Kru0e2D4_OJ1_G5fii-LwHW6tKlgpfw-ZivqQ38KD-vbhu5m_bpfAXY8YGBA |
| 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%3Ajournal&rft.genre=article&rft.atitle=The+Gene-Duplication+Problem%3A+Near-Linear+Time+Algorithms+for+NNI-Based+Local+Searches&rft.jtitle=IEEE%2FACM+transactions+on+computational+biology+and+bioinformatics&rft.au=Bansal%2C+MS&rft.au=Eulenstein%2C+O&rft.au=Wehe%2C+A&rft.date=2009-04-01&rft.issn=1545-5963&rft.volume=6&rft.issue=2&rft_id=info:doi/10.1109%2FTCBB.2009.7&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1545-5963&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1545-5963&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1545-5963&client=summon |