Algorithms for the Reconstruction of Genomic Structures with Proofs of Their Low Polynomial Complexity and High Exactness

The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method. We were provided a network and graphs in its leaves, for which we needed to find a rearrangement of graphs...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics (Basel) Vol. 12; no. 6; p. 817
Main Authors:	Gorbunov, Konstantin, Lyubetsky, Vassily
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.03.2024
Subjects:	Algorithms Chromosomes combinatorial optimization Complexity Costs Errors exact graph algorithm Genes genome as a structure genome reconstruction Genomes Genomics Graphs Leaves Mathematical analysis Optimization path-cycle graph reconstruction Pattern recognition phylogenetic network Polynomials Reconstruction Germany
ISSN:	2227-7390, 2227-7390
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method. We were provided a network and graphs in its leaves, for which we needed to find a rearrangement of graphs by non-leaf nodes, in which the given functional reached its minimum. Such a problem, even in the simplest case, is NP-hard, which means unavoidable restrictions on the network, on graphs, or on the functional. In this publication, this problem is addressed in the case of all graphs being so-called “structures”, meaning directed-loaded graphs consisting of paths and cycles, and the functional as the sum (over all edges in the network) of distances between structures at the endpoints of every edge. The distance itself is equal to the minimal length of sequence from the fixed list of operations, the composition of which transforms the structure at one endpoint of the edge into the structure at its other endpoint. The list of operations (and their costs) on such a graph is fixed. Under these conditions, the given discrete optimization problem is called the reconstruction problem. This paper presents novel algorithms for solving the reconstruction problem, along with full proofs of their low error and low polynomial complexity. For example, for the network, the problem is solved with a zero error algorithm that has a linear polynomial computational complexity; and for the tree the problem is solved using an algorithm with a multiplicative error of at most two, which has a second order polynomial computational complexity.
AbstractList	The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method. We were provided a network and graphs in its leaves, for which we needed to find a rearrangement of graphs by non-leaf nodes, in which the given functional reached its minimum. Such a problem, even in the simplest case, is NP-hard, which means unavoidable restrictions on the network, on graphs, or on the functional. In this publication, this problem is addressed in the case of all graphs being so-called “structures”, meaning directed-loaded graphs consisting of paths and cycles, and the functional as the sum (over all edges in the network) of distances between structures at the endpoints of every edge. The distance itself is equal to the minimal length of sequence from the fixed list of operations, the composition of which transforms the structure at one endpoint of the edge into the structure at its other endpoint. The list of operations (and their costs) on such a graph is fixed. Under these conditions, the given discrete optimization problem is called the reconstruction problem. This paper presents novel algorithms for solving the reconstruction problem, along with full proofs of their low error and low polynomial complexity. For example, for the network, the problem is solved with a zero error algorithm that has a linear polynomial computational complexity; and for the tree the problem is solved using an algorithm with a multiplicative error of at most two, which has a second order polynomial computational complexity.
Audience	Academic
Author	Lyubetsky, Vassily Gorbunov, Konstantin
Author_xml	– sequence: 1 givenname: Konstantin orcidid: 0000-0001-5438-6939 surname: Gorbunov fullname: Gorbunov, Konstantin – sequence: 2 givenname: Vassily orcidid: 0000-0002-3739-9161 surname: Lyubetsky fullname: Lyubetsky, Vassily
BookMark	eNptUU1rGzEQFSWFpm5u_QGCXutEK8mr3aMxaRIwJLS-i1l9eGXWO64kk_jfRxu3EEqlwwwz7z1p5n0mFyOOjpCvFbsWomU3e8h9xVnNmkp9IJecczVXpXHxLv9ErlLasXLaSjSyvSSn5bDFGHK_T9RjpLl39KczOKYcjyYHHCl6eudG3AdDf70Vj9El-lw49Cki-jQhNr0Lka7xmT7hcJrQMNAV7g-Dewn5RGG09D5se3r7AiaPLqUv5KOHIbmrP3FGNj9uN6v7-frx7mG1XM-NZHWed8IJy7q6k7WBhasbXyvVemtrqawTCwYClBDWggQog3ZSWvCMlU7HlBEz8nCWtQg7fYhhD_GkEYJ-K2Dcaog5mMFpkMLVrWpa3gnJvWhs1TLFrXDAfMfrovXtrHWI-PvoUtY7PMax_F6L8mKxgZcwI9dn1BaKaBg95gimXOvKDotpPpT6UjUNXzDZTAR-JpiIKUXntQkZpt0XYhh0xfTksH7vcCF9_4f0d7b_wl8BZhGqeA
CitedBy_id	crossref_primary_10_3103_S0027132225700196
Cites_doi	10.1007/s11538-023-01157-0 10.3390/math9202576 10.1145/300515.300516 10.3390/math8112001 10.1007/978-1-4471-5298-9 10.1371/journal.pcbi.1010621 10.1007/11851561_16 10.1177/1176934318820534 10.1186/s13015-023-00246-y 10.1186/1748-7188-8-21 10.1109/TCBB.2012.144 10.1007/BF02579150 10.1186/1748-7188-8-6 10.1186/s13015-020-00169-y 10.1089/cmb.2011.0118 10.1007/978-94-011-4309-7 10.1186/s13015-021-00200-w 10.1038/s41559-023-02281-9 10.1007/978-3-662-56039-6 10.1007/978-3-662-44753-6_4 10.1007/978-3-030-10837-3 10.1287/inte.16.4.75 10.1137/140959948 10.1093/bioinformatics/btac695 10.1038/s41559-022-01956-z 10.1109/TCBB.2016.2555301 10.7551/mitpress/2022.001.0001 10.1126/sciadv.abi5884 10.1109/TCBB.2011.34 10.1073/pnas.89.14.6575 10.7155/jgaa.00175 10.3390/a14050152 10.1016/j.tcs.2008.01.013 10.1007/978-3-319-05269-4_22 10.3390/math11092024 10.1089/cmb.2020.0434 10.1101/2023.03.17.533068 10.1093/nar/gkab1091 10.1186/1471-2105-10-120
ContentType	Journal Article
Copyright	COPYRIGHT 2024 MDPI AG 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: COPYRIGHT 2024 MDPI AG – notice: 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	AAYXX CITATION 3V. 7SC 7TB 7XB 8AL 8FD 8FE 8FG 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO FR3 GNUQQ HCIFZ JQ2 K7- KR7 L6V L7M L~C L~D M0N M7S P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U DOA
DOI	10.3390/math12060817
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) SciTech Premium Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Engineering Research Database ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Civil Engineering Abstracts ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database ProQuest Engineering Database (NC LIVE) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic Directory of Open Access Journals (DOAJ)
DatabaseTitle	CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection Civil Engineering Abstracts ProQuest Computing Engineering Database ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni)
DatabaseTitleList	CrossRef Publicly Available Content Database
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics
EISSN	2227-7390
ExternalDocumentID	oai_doaj_org_article_a43e697892b342f38d19072d3ea0fb26 A788250480 10_3390_math12060817
GeographicLocations	Germany
GeographicLocations_xml	– name: Germany
GroupedDBID	-~X 5VS 85S 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ABPPZ ABUWG ACIPV ACIWK ADBBV AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS AMVHM ARAPS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO GNUQQ GROUPED_DOAJ HCIFZ IAO ITC K6V K7- KQ8 L6V M7S MODMG M~E OK1 PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS RNS 3V. 7SC 7TB 7XB 8AL 8FD 8FK FR3 JQ2 KR7 L7M L~C L~D M0N P62 PKEHL PQEST PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c406t-b3e3d0b6b46ca5e68f6779fdd647de350a3a733dda4aa222b44daf00350b07c3
IEDL.DBID	K7-
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001192425500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2227-7390
IngestDate	Tue Oct 14 18:41:53 EDT 2025 Mon Nov 10 11:11:13 EST 2025 Tue Nov 04 18:23:50 EST 2025 Sat Nov 29 07:15:35 EST 2025 Tue Nov 18 21:57:37 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	6
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c406t-b3e3d0b6b46ca5e68f6779fdd647de350a3a733dda4aa222b44daf00350b07c3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-5438-6939 0000-0002-3739-9161
OpenAccessLink	https://www.proquest.com/docview/3003339200?pq-origsite=%requestingapplication%
PQID	3003339200
PQPubID	2032364
ParticipantIDs	doaj_primary_oai_doaj_org_article_a43e697892b342f38d19072d3ea0fb26 proquest_journals_3003339200 gale_infotracacademiconefile_A788250480 crossref_citationtrail_10_3390_math12060817 crossref_primary_10_3390_math12060817
PublicationCentury	2000
PublicationDate	2024-03-01
PublicationDateYYYYMMDD	2024-03-01
PublicationDate_xml	– month: 03 year: 2024 text: 2024-03-01 day: 01
PublicationDecade	2020
PublicationPlace	Basel
PublicationPlace_xml	– name: Basel
PublicationTitle	Mathematics (Basel)
PublicationYear	2024
Publisher	MDPI AG
Publisher_xml	– name: MDPI AG
References	Mah (ref_8) 2024; 8 Karmarkar (ref_39) 1984; 4 ref_14 ref_36 ref_13 ref_35 ref_12 ref_34 ref_30 Machado (ref_26) 2017; 14 Feijao (ref_10) 2011; 8 ref_19 ref_16 ref_15 ref_37 Nguyen (ref_4) 2022; 50 Braga (ref_22) 2011; 18 Serge (ref_7) 2022; 38 Alekseyev (ref_20) 2008; 395 Fischer (ref_38) 2015; 29 Bergeron (ref_11) 2006; Volume 4175 ref_24 ref_23 Muffato (ref_3) 2023; 7 ref_21 ref_42 Hannenhalli (ref_18) 1999; 46 ref_41 Hooker (ref_40) 1986; 16 ref_1 Compeau (ref_25) 2014; Volume 8701 Angibaud (ref_31) 2009; 13 Simakov (ref_6) 2022; 8 ref_2 ref_28 ref_27 Bohnenkamper (ref_33) 2021; 28 ref_9 Shao (ref_29) 2014; Volume 8394 ref_5 Bulteau (ref_32) 2013; 10 Sankoff (ref_17) 1992; 89
References_xml	– ident: ref_9 doi: 10.1007/s11538-023-01157-0 – ident: ref_28 doi: 10.3390/math9202576 – volume: 46 start-page: 1 year: 1999 ident: ref_18 article-title: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals publication-title: J. ACM doi: 10.1145/300515.300516 – ident: ref_21 doi: 10.3390/math8112001 – ident: ref_14 doi: 10.1007/978-1-4471-5298-9 – ident: ref_1 doi: 10.1371/journal.pcbi.1010621 – volume: Volume 4175 start-page: 163 year: 2006 ident: ref_11 article-title: A unifying view of genome rearrangements publication-title: Algorithms in Bioinformatics doi: 10.1007/11851561_16 – ident: ref_36 doi: 10.1177/1176934318820534 – ident: ref_12 doi: 10.1186/s13015-023-00246-y – ident: ref_24 doi: 10.1186/1748-7188-8-21 – volume: 10 start-page: 1384 year: 2013 ident: ref_32 article-title: Inapproximability of (1,2)-exemplar distance publication-title: IEEE/ACM Trans. Comput. Biol. Bioinf. doi: 10.1109/TCBB.2012.144 – volume: 4 start-page: 373 year: 1984 ident: ref_39 article-title: A new polynomial-time algorithm for linear programming publication-title: Combinatorica doi: 10.1007/BF02579150 – ident: ref_23 doi: 10.1186/1748-7188-8-6 – ident: ref_34 doi: 10.1186/s13015-020-00169-y – volume: 18 start-page: 1167 year: 2011 ident: ref_22 article-title: Double cut and join with insertions and deletions publication-title: J. Comput. Biol. doi: 10.1089/cmb.2011.0118 – ident: ref_30 doi: 10.1007/978-94-011-4309-7 – ident: ref_35 doi: 10.1186/s13015-021-00200-w – volume: 8 start-page: 325 year: 2024 ident: ref_8 article-title: Cell type evolution reconstruction across species through cell phylogenies of single-cell RNA sequencing data publication-title: Nat. Ecol. Evol. doi: 10.1038/s41559-023-02281-9 – ident: ref_27 – ident: ref_42 doi: 10.1007/978-3-662-56039-6 – volume: Volume 8701 start-page: 38 year: 2014 ident: ref_25 article-title: A Generalized Cost Model for DCJ-Indel Sorting publication-title: Algorithms in Bioinformatics doi: 10.1007/978-3-662-44753-6_4 – ident: ref_15 doi: 10.1007/978-3-030-10837-3 – volume: 16 start-page: 75 year: 1986 ident: ref_40 article-title: Karmarkar’s Linear Programming Algorithm publication-title: Interfaces doi: 10.1287/inte.16.4.75 – ident: ref_41 – volume: 29 start-page: 559 year: 2015 ident: ref_38 article-title: On computing the maximum parsimony score of a phylogenetic network publication-title: SIAM J. Discret. Math. doi: 10.1137/140959948 – volume: 38 start-page: 5434 year: 2022 ident: ref_7 article-title: SYNPHONI: Scale-free and phylogeny-aware reconstruction of synteny conservation and transformation across animal genomes publication-title: Bioinformatics doi: 10.1093/bioinformatics/btac695 – volume: 7 start-page: 355 year: 2023 ident: ref_3 article-title: Reconstruction of hundreds of reference ancestral genomes across the eukaryotic kingdom publication-title: Nat. Ecol. Evol. doi: 10.1038/s41559-022-01956-z – volume: 14 start-page: 728 year: 2017 ident: ref_26 article-title: Genomic Distance with High Indel Costs publication-title: J. IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2016.2555301 – ident: ref_16 doi: 10.7551/mitpress/2022.001.0001 – volume: 8 start-page: eabi5884 year: 2022 ident: ref_6 article-title: Deeply conserved synteny and the evolution of metazoan chromosomes publication-title: Sci. Adv. doi: 10.1126/sciadv.abi5884 – volume: 8 start-page: 1318 year: 2011 ident: ref_10 article-title: SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2011.34 – volume: 89 start-page: 6575 year: 1992 ident: ref_17 article-title: Gene order comparisons for phylogenetic inference: Evolution of mitochondrial genome publication-title: Proc. Natl. Acad. Sci. USA doi: 10.1073/pnas.89.14.6575 – ident: ref_19 – volume: 13 start-page: 19 year: 2009 ident: ref_31 article-title: On the approximability of comparing genomes with duplicates publication-title: J. Graph Algorithms Appl. doi: 10.7155/jgaa.00175 – ident: ref_5 doi: 10.3390/a14050152 – volume: 395 start-page: 193 year: 2008 ident: ref_20 article-title: Multi-Break Rearrangements and Chromosomal Evolution publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.01.013 – volume: Volume 8394 start-page: 280 year: 2014 ident: ref_29 article-title: An exact algorithm to compute the DCJ distance for genomes with duplicate genes publication-title: Research in Computational Molecular Biology doi: 10.1007/978-3-319-05269-4_22 – ident: ref_37 doi: 10.3390/math11092024 – volume: 28 start-page: 410 year: 2021 ident: ref_33 article-title: Computing the Rearrangement Distance of Natural Genomes publication-title: J. Comput. Biol. doi: 10.1089/cmb.2020.0434 – ident: ref_2 doi: 10.1101/2023.03.17.533068 – volume: 50 start-page: D1025 year: 2022 ident: ref_4 article-title: Genomicus in 2022: Comparative tools for thousands of genomes and reconstructed ancestors publication-title: Nucleic Acids Res. doi: 10.1093/nar/gkab1091 – ident: ref_13 doi: 10.1186/1471-2105-10-120
SSID	ssj0000913849
Score	2.2558413
Snippet	The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in...
SourceID	doaj proquest gale crossref
SourceType	Open Website Aggregation Database Enrichment Source Index Database
StartPage	817
SubjectTerms	Algorithms Chromosomes combinatorial optimization Complexity Costs Errors exact graph algorithm Genes genome as a structure genome reconstruction Genomes Genomics Graphs Leaves Mathematical analysis Optimization path-cycle graph reconstruction Pattern recognition phylogenetic network Polynomials Reconstruction
SummonAdditionalLinks	– databaseName: Directory of Open Access Journals (DOAJ) dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQYoAB8RSFgjyAGFCEG7txMhbEYwBUiQ5slp-AVBpEyqP_njsnlDIgFlbn5Dj2-e6-2PcdIfsueKelYIkGb58IzkJipPOJZcGYNGfGupgofCVvbvK7u6I_U-oL74TV9MD1xB1rwX0GUKdIDRdp4LkDFyZTx72G7tJItg1RzwyYija46PBcFPVNdw64_hjiv4dOyjJwgfKHD4pU_b8Z5OhlzlfIchMe0l49rFUy50drZOl6yq1arZNJb3hfAqR_eKooRJwUHlEEkd9UsLQM9MLHfGN6GxtfAVRT_OVK-xAphwolBnhEQK_Kd9ovhxOUhhejeUCKzPGE6pGjeAuEnn1oO0aLuEEG52eD08ukKaCQWPDT48Rwzx0zmRGZ1V2f5SGTsgjOZQLWg3eZ5lpy7pwWWkOgYIRwOsTDRsOk5ZtkflSO_BahzFopmQZHBig2uI4BJ5YGD91IHTImW-Toa0aVbcjFscbFUAHIwPlXs_PfIgdT6eeaVOMXuRNcnKkMUmHHBlAQ1SiI-ktBWuQQl1bhhoUhWd3kHcCHIfWV6kkAGV1MrW-R9tfqq2YnV4pjtTsIIhnb_o_R7JDFFMKi-hZbm8yDEvhdsmDfxo_Vy15U4k_8BPiF priority: 102 providerName: Directory of Open Access Journals
Title	Algorithms for the Reconstruction of Genomic Structures with Proofs of Their Low Polynomial Complexity and High Exactness
URI	https://www.proquest.com/docview/3003339200 https://doaj.org/article/a43e697892b342f38d19072d3ea0fb26
Volume	12
WOSCitedRecordID	wos001192425500001&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: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: M~E dateStart: 20130101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: BENPR dateStart: 20130301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Computer Science Database (NC LIVE) customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: K7- dateStart: 20130301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Engineering Database (NC LIVE) customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: M7S dateStart: 20130301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: PIMPY dateStart: 20130301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LbxMxELag5UAPvBGBEvkA4oCsOrZjb04oRSkg2mhFcyinlZ8tUsi23eWRC7-dGWeTwqFcuOxhPd6HZjwvj78h5EVIMVijOLNg7ZmSPDFnQmSeJ-dEwZ0P-aDwoZlOi5OTUdkl3JqurHKtE7OiDrXHHPmexK5jYMw5f3N-wbBrFO6udi00bpLtgRADlPOPhm1yLIh5WajRqt4dJvM98ALPBoJrMITmL0uUAfuvU8vZ1hzc_d-vvEfudF4mHa_E4j65ERcPyM7RBqK1eUiW4_kpzGzPvjYUHFcKQxRj0StEWVon-i7mY8v0ON_8BrE5xcwtLcHhTg1SzHCngR7WP2hZz5dIDS9GLYNIm-2S2kWgWExCJz-tb1GxPiKzg8ns7XvW9WFgHsx9y5yMMnCnndLeDqMukjZmlELQCtgqh9xKa6QMwSprwd9wSgWb8p6l48bLx2RrUS_iE0K598ZwC_YQguEUBg5soUgRHmNs0tz0yOs1SyrfYZRjq4x5BbEKMrD6k4E98nJDfb7C5riGbh-5u6FBRO18o748rboFWlklo4aQeiScVCLJIoCrZESQ0YLYCt0jr1A2Klz38EnedscX4McQQasaG4hVhnhCv0d217JRdQqhqa4E4-m_h5-R2wL8plWZ2y7ZAvbG5-SW_95-aS77ZHt_Mi0_9XPqoJ-lvY_lqsd4_TWB8fLDUfn5N5BwDTE
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VggQceCMCBfZAxQFZ3Xo3XvuAUICWVkmjSOTQ22qfLVKIS2wo-VH8R2ZsJ4VDufXAdT2y1_a3883s4xuAVz4Gb5TkiUG2T6TgMbHKh8TxaG2ac-t8c1B4pMbj_Pi4mGzAr9VZGNpWufKJjaP2paM58h1BVceQzDl_d_YtoapRtLq6KqHRwmIYlueYslVvDz_i_91O0_296YeDpKsqkDgkrzqxIgjPbWZl5kw_ZHnMlCqi95nEToo-N8IoIbw30hhkTyulN7FZgbNcOYG3vQbXpcgVSfUPVbKe0iGJzVwW7fZ67CvfwaDzdDflGfKu-ov4mvoAl7FAQ237d_-zj3IP7nQxNBu0oL8PG2H-AG4frQVoq4ewHMxOsKP16deKYVjO8BKjTPtCL5eVkX0KzaFs9rlp_L4IFaN5aTbBdCJWZDGldRQ2Ks_ZpJwtyRofTD6UdETrJTNzz2irDNv7aVxNtPEIplfx6o9hc17OwxNg3DmluEG2x1Q_-l2LTJ_GgLdRJmZc9eDNCgHadQrsVAhkpjETI7zoP_HSg-219VmrPHKJ3XsC09qG9MKbhnJxojv3o40UIStUXqRWyDSK3GMgqFIvgsFBmWY9eE1Q1OTVsEvOdIcz8MVIH0wPFGZifdIf6MHWCoq6c3eVvsDh039ffgk3D6ZHIz06HA-fwa0UI8R2Q98WbOKvDs_hhvtRf6kWL5qhxUBfMWp_Ay96ZCU
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LbxMxELZKQQgOPIsIFPCBigNaxbWd9e4BoUAbqBKiSOTQm-VnixSyJbtQ8tP4d8zsI4VDufXAdXe08WY_zzdjj78h5KWPwRslWWKA7RMpWEys8iFxLFrLM2adrw8KT9R0mh0f57Mt8qs7C4NllZ1PrB21LxyukfcFdh0DMmesH9uyiNnB6O3ZtwQ7SOFOa9dOo4HIOKzPIX0r3xwdwLfe43x0OH__MWk7DCQOiKxKrAjCM5tamTozCGkWU6Xy6H0qYcBiwIwwSgjvjTQGmNRK6U2sd-MsU07AY6-R60DCA5xiY5VslndQbjOTeVNqD-NmfQhAT_c5S4GD1V8kWPcKuIwRapob3f2P_6B75E4bW9NhMxnuk62wfEBuf9oI05YPyXq4OIGBVqdfSwrhOoVbFDPwCx1dWkT6IdSHtenn-uL3VSgprlfTGaQZsUSLOe6v0ElxTmfFYo3W8MPoW1FftFpTs_QUS2jo4U_jKqSTHTK_ild_RLaXxTI8JpQ5pxQzEAVwJaPftxAB8BjgMcrElKkeed2hQbtWmR0bhCw0ZGiIHf0ndnpkb2N91iiSXGL3DoG1sUEd8fpCsTrRrVvSRoqQ5irLuRWSR5F5CBAV9yIYmKw87ZFXCEuN3g6G5Ex7aANeDHXD9FBBhjZAXYIe2e1gqVs3WOoLTD759-0X5CaAVU-OpuOn5BaHwLGp89sl2_ClwzNyw_2ovpSr5_Uso0RfMWh_A5ohbN8
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=Algorithms+for+the+Reconstruction+of+Genomic+Structures+with+Proofs+of+Their+Low+Polynomial+Complexity+and+High+Exactness&rft.jtitle=Mathematics+%28Basel%29&rft.au=Gorbunov%2C+Konstantin&rft.au=Lyubetsky%2C+Vassily&rft.date=2024-03-01&rft.issn=2227-7390&rft.eissn=2227-7390&rft.volume=12&rft.issue=6&rft.spage=817&rft_id=info:doi/10.3390%2Fmath12060817&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_math12060817
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2227-7390&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2227-7390&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2227-7390&client=summon