Sorting Permutations by Intergenic Operations
Genome Rearrangements are events that affect large stretches of genomes during evolution. Many mathematical models have been used to estimate the evolutionary distance between two genomes based on genome rearrangements. However, most of them focused on the (order of the) genes of a genome, disregard...
Saved in:
| Published in: | IEEE/ACM transactions on computational biology and bioinformatics Vol. 18; no. 6; pp. 2080 - 2093 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
IEEE
01.11.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers |
| Subjects: | |
| ISSN: | 1545-5963, 1557-9964, 1557-9964 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Genome Rearrangements are events that affect large stretches of genomes during evolution. Many mathematical models have been used to estimate the evolutionary distance between two genomes based on genome rearrangements. However, most of them focused on the (order of the) genes of a genome, disregarding other important elements in it. Recently, researchers have shown that considering regions between each pair of genes, called intergenic regions , can enhance distance estimation in realistic data. Two of the most studied genome rearrangements are the reversal , which inverts a sequence of genes, and the transposition , which occurs when two adjacent gene sequences swap their positions inside the genome. In this work, we study the transposition distance between two genomes, but we also consider intergenic regions, a problem we name Sorting by Intergenic Transpositions. We show that this problem is NP-hard and propose two approximation algorithms, with factors 3.5 and 2.5, considering two distinct definitions for the problem. We also investigate the signed reversal and transposition distance between two genomes considering their intergenic regions. This second problem is called Sorting by Signed Intergenic Reversals and Intergenic Transpositions. We show that this problem is NP-hard and develop two approximation algorithms, with factors 3 and 2.5. We check how these algorithms behave when assigning weights for genome rearrangements. Finally, we implemented all these algorithms and tested them on real and simulated data. |
|---|---|
| AbstractList | Genome Rearrangements are events that affect large stretches of genomes during evolution. Many mathematical models have been used to estimate the evolutionary distance between two genomes based on genome rearrangements. However, most of them focused on the (order of the) genes of a genome, disregarding other important elements in it. Recently, researchers have shown that considering regions between each pair of genes, called intergenic regions , can enhance distance estimation in realistic data. Two of the most studied genome rearrangements are the reversal , which inverts a sequence of genes, and the transposition , which occurs when two adjacent gene sequences swap their positions inside the genome. In this work, we study the transposition distance between two genomes, but we also consider intergenic regions, a problem we name Sorting by Intergenic Transpositions. We show that this problem is NP-hard and propose two approximation algorithms, with factors 3.5 and 2.5, considering two distinct definitions for the problem. We also investigate the signed reversal and transposition distance between two genomes considering their intergenic regions. This second problem is called Sorting by Signed Intergenic Reversals and Intergenic Transpositions. We show that this problem is NP-hard and develop two approximation algorithms, with factors 3 and 2.5. We check how these algorithms behave when assigning weights for genome rearrangements. Finally, we implemented all these algorithms and tested them on real and simulated data. Genome Rearrangements are events that affect large stretches of genomes during evolution. Many mathematical models have been used to estimate the evolutionary distance between two genomes based on genome rearrangements. However, most of them focused on the (order of the) genes of a genome, disregarding other important elements in it. Recently, researchers have shown that considering regions between each pair of genes, called intergenic regions, can enhance distance estimation in realistic data. Two of the most studied genome rearrangements are the reversal, which inverts a sequence of genes, and the transposition, which occurs when two adjacent gene sequences swap their positions inside the genome. In this work, we study the transposition distance between two genomes, but we also consider intergenic regions, a problem we name Sorting by Intergenic Transpositions. We show that this problem is NP-hard and propose two approximation algorithms, with factors 3.5 and 2.5, considering two distinct definitions for the problem. We also investigate the signed reversal and transposition distance between two genomes considering their intergenic regions. This second problem is called Sorting by Signed Intergenic Reversals and Intergenic Transpositions. We show that this problem is NP-hard and develop two approximation algorithms, with factors 3 and 2.5. We check how these algorithms behave when assigning weights for genome rearrangements. Finally, we implemented all these algorithms and tested them on real and simulated data.Genome Rearrangements are events that affect large stretches of genomes during evolution. Many mathematical models have been used to estimate the evolutionary distance between two genomes based on genome rearrangements. However, most of them focused on the (order of the) genes of a genome, disregarding other important elements in it. Recently, researchers have shown that considering regions between each pair of genes, called intergenic regions, can enhance distance estimation in realistic data. Two of the most studied genome rearrangements are the reversal, which inverts a sequence of genes, and the transposition, which occurs when two adjacent gene sequences swap their positions inside the genome. In this work, we study the transposition distance between two genomes, but we also consider intergenic regions, a problem we name Sorting by Intergenic Transpositions. We show that this problem is NP-hard and propose two approximation algorithms, with factors 3.5 and 2.5, considering two distinct definitions for the problem. We also investigate the signed reversal and transposition distance between two genomes considering their intergenic regions. This second problem is called Sorting by Signed Intergenic Reversals and Intergenic Transpositions. We show that this problem is NP-hard and develop two approximation algorithms, with factors 3 and 2.5. We check how these algorithms behave when assigning weights for genome rearrangements. Finally, we implemented all these algorithms and tested them on real and simulated data. |
| Author | Jean, Geraldine Fertin, Guillaume Brito, Klairton Lima Dias, Ulisses Dias, Zanoni Oliveira, Andre Rodrigues |
| Author_xml | – sequence: 1 givenname: Andre Rodrigues orcidid: 0000-0002-0568-1859 surname: Oliveira fullname: Oliveira, Andre Rodrigues email: andrero@ic.unicamp.br organization: Institute of Computing, University of Campinas, Campinas, Brazil – sequence: 2 givenname: Geraldine surname: Jean fullname: Jean, Geraldine email: geraldine.jean@univ-nantes.fr organization: LS2N CNRS UMR 6004, University of Nantes, Nantes, France – sequence: 3 givenname: Guillaume orcidid: 0000-0002-8251-2012 surname: Fertin fullname: Fertin, Guillaume email: guillaume.fertin@univ-nantes.fr organization: LS2N CNRS UMR 6004, University of Nantes, Nantes, France – sequence: 4 givenname: Klairton Lima orcidid: 0000-0001-5287-2925 surname: Brito fullname: Brito, Klairton Lima email: klairton@ic.unicamp.br organization: Institute of Computing, University of Campinas, Campinas, Brazil – sequence: 5 givenname: Ulisses orcidid: 0000-0002-4763-3046 surname: Dias fullname: Dias, Ulisses email: ulisses@ft.unicamp.br organization: School of Technology, University of Campinas, Limeira, Brazil – sequence: 6 givenname: Zanoni orcidid: 0000-0003-3333-6822 surname: Dias fullname: Dias, Zanoni email: zanoni@ic.unicamp.br organization: Institute of Computing, University of Campinas, Campinas, Brazil |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/33945484$$D View this record in MEDLINE/PubMed https://hal.science/hal-03346838$$DView record in HAL |
| BookMark | eNp9kUtLJDEUhcOgjI-ZHzAI0jAbXVSb5Oa51MYXNCjorEOq-pZGqqvapErw30-Kal24cJWQ-517b845IDtt1yIhfxidM0bt2ePi4mLOKWdzoFoLZn6QfSalLqxVYme8C1lIq2CPHKT0QikXloqfZA_ACimM2CfFQxf70D7N7jGuh973oWvTrHyf3bY9xidsQzW722CcCr_Ibu2bhL-35yH5d3X5uLgplnfXt4vzZVGBgb6AGgWURtflipWKal76mjJVVorZyqiVt5pLqOqV0goNylozYT3jeSPBQQs4JKdT32ffuE0Max_fXeeDuzlfuvGNAghlwLyxzJ5M7CZ2rwOm3q1DqrBpfIvdkByXnIPVGmhG_35BX7ohtvknjuc1jc3jZaaOt9RQrnH1Of_DtAzoCahil1LE2lVhcq6PPjSOUTfG48Z43BiP28aTleyL8qP5d5qjSRMQ8ZO32SipDfwHIjOWxw |
| CODEN | ITCBCY |
| CitedBy_id | crossref_primary_10_1109_TCBB_2024_3467033 crossref_primary_10_1145_3653295 crossref_primary_10_1186_s13015_021_00200_w crossref_primary_10_1007_s10878_023_01083_w crossref_primary_10_1109_TCBB_2022_3165443 crossref_primary_10_1109_TCBB_2022_3215615 crossref_primary_10_1089_cmb_2023_0087 crossref_primary_10_1186_s13015_021_00203_7 |
| Cites_doi | 10.1093/bioinformatics/btm500 10.1007/978-3-642-04241-6_31 10.1109/TCBB.2006.44 10.1145/300515.300516 10.1007/978-3-319-40189-8_4 10.1137/110851390 10.1093/bioinformatics/bti535 10.1089/cmb.2020.0434 10.1145/1722024.1722051 10.1109/TCBB.2015.2474400 10.1109/SPIRE.1998.712988 10.1109/TCBB.2017.2708121 10.1089/cmb.2019.0293 10.1109/TCBB.2018.2831661 10.1093/molbev/msz240 10.1137/S0097539793250627 10.1093/nar/gkaa958 10.1109/TCBB.2016.2515594 10.1089/cmb.2019.0078 10.1186/s12859-016-1264-6 10.1137/S089548019528280X 10.1109/TCBB.2020.2993002 10.1007/BF01188586 10.1109/SFCS.1995.492588 10.1016/S0304-3975(01)00338-3 10.1089/cmb.2007.R006 10.1093/gbe/evw083 10.1186/s13015-017-0107-y |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| 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 1XC |
| DOI | 10.1109/TCBB.2021.3077418 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) 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 Hyper Article en Ligne (HAL) |
| 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 | MEDLINE MEDLINE - Academic Materials 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 Computer Science |
| EISSN | 1557-9964 |
| EndPage | 2093 |
| ExternalDocumentID | oai:HAL:hal-03346838v1 33945484 10_1109_TCBB_2021_3077418 9423578 |
| Genre | orig-research Research Support, Non-U.S. Gov't Journal Article |
| GrantInformation_xml | – fundername: Brazilian Federal Agency grantid: 831/15 – fundername: National Counsel of Technological and Scientific Development grantid: 400487/2016-0; 425340/2016-3; 140466/2018-5 – fundername: São Paulo Research Foundation grantid: 2013/08293-7; 2015/11937-9; 2017/12646-3; 2019/27331-3 |
| 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 AAYOK ADPZR CGR CUY CVF ECM EIF NPM RIG W7O 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 1XC |
| ID | FETCH-LOGICAL-c383t-3fe43b87fbd1b6072baf016bc619c86da97253cfd676e8e5f7149a12484423743 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000728193500005&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 14 20:35:27 EDT 2025 Mon Sep 29 03:50:02 EDT 2025 Sun Nov 09 08:26:47 EST 2025 Thu Apr 03 07:08:55 EDT 2025 Sat Nov 29 01:52:05 EST 2025 Tue Nov 18 22:31:17 EST 2025 Wed Aug 27 05:11:52 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c383t-3fe43b87fbd1b6072baf016bc619c86da97253cfd676e8e5f7149a12484423743 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ORCID | 0000-0001-5287-2925 0000-0002-8251-2012 0000-0003-3333-6822 0000-0002-0568-1859 0000-0002-4763-3046 0000-0002-1534-2682 |
| PMID | 33945484 |
| PQID | 2607894425 |
| PQPubID | 85499 |
| PageCount | 14 |
| ParticipantIDs | proquest_miscellaneous_2522397730 proquest_journals_2607894425 hal_primary_oai_HAL_hal_03346838v1 ieee_primary_9423578 pubmed_primary_33945484 crossref_citationtrail_10_1109_TCBB_2021_3077418 crossref_primary_10_1109_TCBB_2021_3077418 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-11-01 |
| PublicationDateYYYYMMDD | 2021-11-01 |
| PublicationDate_xml | – month: 11 year: 2021 text: 2021-11-01 day: 01 |
| PublicationDecade | 2020 |
| 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 | 2021 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) – name: Institute of Electrical and Electronics Engineers |
| References | ref13 ref12 ref14 ref30 ref11 ref10 ref2 ref1 ref17 ref16 ref19 ref18 hartmann (ref9) 2017; 15 ref24 ref23 ref26 ref25 ref20 oliveira (ref27) 2017; 23 ref22 ref21 ref28 ref29 ref8 ref7 ref4 ref3 ref6 ref5 saitou (ref15) 1987; 4 |
| References_xml | – ident: ref30 doi: 10.1093/bioinformatics/btm500 – ident: ref14 doi: 10.1007/978-3-642-04241-6_31 – ident: ref5 doi: 10.1109/TCBB.2006.44 – volume: 23 start-page: 868 year: 2017 ident: ref27 article-title: On the sorting by reversals and transpositions problem publication-title: J Univ Comput Sci – ident: ref6 doi: 10.1145/300515.300516 – ident: ref17 doi: 10.1007/978-3-319-40189-8_4 – ident: ref4 doi: 10.1137/110851390 – ident: ref3 doi: 10.1093/bioinformatics/bti535 – ident: ref13 doi: 10.1089/cmb.2020.0434 – ident: ref26 doi: 10.1145/1722024.1722051 – ident: ref12 doi: 10.1109/TCBB.2015.2474400 – ident: ref8 doi: 10.1109/SPIRE.1998.712988 – volume: 15 start-page: 1585 year: 2017 ident: ref9 article-title: Genome rearrangement with ILP publication-title: IEEE/ACM Trans Comput Biol Bioinf doi: 10.1109/TCBB.2017.2708121 – ident: ref21 doi: 10.1089/cmb.2019.0293 – ident: ref10 doi: 10.1109/TCBB.2018.2831661 – ident: ref29 doi: 10.1093/molbev/msz240 – ident: ref23 doi: 10.1137/S0097539793250627 – ident: ref28 doi: 10.1093/nar/gkaa958 – ident: ref11 doi: 10.1109/TCBB.2016.2515594 – volume: 4 start-page: 406 year: 1987 ident: ref15 article-title: The neighbor-joining method: A new method for reconstructing phylogenetic trees publication-title: Mol Biol Evol – ident: ref7 doi: 10.1089/cmb.2019.0078 – ident: ref19 doi: 10.1186/s12859-016-1264-6 – ident: ref1 doi: 10.1137/S089548019528280X – ident: ref20 doi: 10.1109/TCBB.2020.2993002 – ident: ref2 doi: 10.1007/BF01188586 – ident: ref22 doi: 10.1109/SFCS.1995.492588 – ident: ref25 doi: 10.1016/S0304-3975(01)00338-3 – ident: ref24 doi: 10.1089/cmb.2007.R006 – ident: ref16 doi: 10.1093/gbe/evw083 – ident: ref18 doi: 10.1186/s13015-017-0107-y |
| SSID | ssj0024904 |
| Score | 2.3637993 |
| Snippet | Genome Rearrangements are events that affect large stretches of genomes during evolution. Many mathematical models have been used to estimate the evolutionary... |
| SourceID | hal proquest pubmed crossref ieee |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 2080 |
| SubjectTerms | Algorithms Approximation Approximation algorithms Bioinformatics Computational Complexity Computer Science Data Structures and Algorithms DNA DNA Transposable Elements - genetics DNA, Intergenic - genetics Gene Rearrangement - genetics Gene sequencing Genes Genome - genetics Genome rearrangements Genomes Genomics Genomics - methods intergenic regions Mathematical analysis Mathematical models Nucleotide sequence Permutations Phylogeny reversals Sequence Analysis, DNA Sorting Transforms Transposition transpositions |
| Title | Sorting Permutations by Intergenic Operations |
| URI | https://ieeexplore.ieee.org/document/9423578 https://www.ncbi.nlm.nih.gov/pubmed/33945484 https://www.proquest.com/docview/2607894425 https://www.proquest.com/docview/2522397730 https://hal.science/hal-03346838 |
| Volume | 18 |
| WOSCitedRecordID | wos000728193500005&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/eLvHCXMwlV1LS8QwEB5cUfHi-1FfVPEkVttNm6RHFcWDqKDC3kqSpirIrrgP2H_vTNKtCCp4K820TWYmnZlM8g3AoZa8wqZ2ZKXFAMWWKpIZL6NES2sVZ0J6dP0bcXsrO538fgqOm7Mw1lq3-cye0KXL5Zc9M6SlstM8deAsLWgJwf1ZrS9cvdyVCiSPIMpQq-oMZhLnp48X5-cYCbaTE1RoQmuZhznG8hSd9fSbOWq90GZIV2Xld4fTGZ6rxf91eQkWagczPPMasQxTtrsCs77k5HgVooce4QY8h_f4Sx76PHw_1OPQLQ2iNr2a8O7der3or8HT1eXjxXVUl0yIDIaag4hVNmVaikqXieaxaGtVoVOnDcZJRvJS5aKdMVOVXHCUTlYJjJAU2niZ0v6YlK3DdLfXtZsQlmi7VaLQ_SoNwdhLi0JNmNKUalSpCiCecK4wNZ44lbV4K1xcEecF8b0gvhc13wM4ah5592AafxEfoDgaOoLBvj67KehezFjKJZOjJIBV4nlDVbM7gJ2J9Ip6TvYLHIOQOY4zC2C_acbZRCkS1bW9IdKgO0ouMYsD2PBSb949UZmtn7-5DfPUfX9OcQemBx9DuwszZjR47X_socp25J5T2U9f0OIx |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1ZS8QwEB689cX7qGcVn8Rqu-mRPqooK66r4Aq-hSRNVZDdZQ_Bf-9M2q0IKvhW2umRmUnzTSb5BuBQ8TjHSzXPcIMBismkx6M48wLFjZExS3jBrt9Imk3-9JTej8FxtRfGGGMXn5kTOrS5_KyjhzRVdpqGlpxlHCapcla5W-uLWS-1xQIJE3gR-lWZwwz89LR1cX6OsWAtOEGXJr6WOZhhLA0RroffBqTxF1oOaeus_A457dBztfC_j16E-RJiumeFTyzBmGkvw3RRdPJjBbyHDjEHPLv3-FMeFpn4vqs-XDs5iP70qt27rik8o78Kj1eXrYu6VxZN8DQGmwOP5SZkiie5ygIV-0lNyRxhndIYKWkeZzJNahHTeRYnMdonyhOMkSSO8jykFTIhW4OJdqdtNsDNcPSWgUQAlmkisucGzRowqSjZKEPpgD_SnNAlozgVtngTNrLwU0F6F6R3UerdgaPqlm5Bp_GX8AGao5IjIuz6WUPQOZ-xMOaMvwcOrJDOK6lS3Q5sj6wnyl7ZF9iGhKfYzsiB_eoy9idKksi26QxRBgEpgWLmO7BeWL169shlNn9-5x7M1lu3DdG4bt5swRw1pdi1uA0Tg97Q7MCUfh-89nu71nE_AQBi5JI |
| 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=Sorting+Permutations+by+Intergenic+Operations&rft.jtitle=IEEE%2FACM+transactions+on+computational+biology+and+bioinformatics&rft.au=Oliveira%2C+Andre+Rodrigues&rft.au=Jean%2C+Geraldine&rft.au=Fertin%2C+Guillaume&rft.au=Brito%2C+Klairton+Lima&rft.date=2021-11-01&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=1545-5963&rft.eissn=1557-9964&rft.spage=1&rft.epage=1&rft_id=info:doi/10.1109%2FTCBB.2021.3077418&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-03346838v1 |
| 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 |