On the Linearization of Scaffolds Sharing Repeated Contigs
Scaffolding is the final step in assembling Next Generation Sequencing data, in which pre-assembled contiguous regions (“contigs”) are oriented and ordered using information that links them (for example, mapping of paired-end reads). As the genome of some species is highly repetitive, we allow placi...
Saved in:
Published in | Combinatorial Optimization and Applications Vol. 10628; pp. 509 - 517 |
---|---|
Main Authors | , , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
2017
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Online Access | Get full text |
ISBN | 9783319711461 3319711466 |
ISSN | 0302-9743 1611-3349 |
DOI | 10.1007/978-3-319-71147-8_38 |
Cover
Loading…
Abstract | Scaffolding is the final step in assembling Next Generation Sequencing data, in which pre-assembled contiguous regions (“contigs”) are oriented and ordered using information that links them (for example, mapping of paired-end reads). As the genome of some species is highly repetitive, we allow placing some contigs multiple times, thereby generalizing established computational models for this problem. We study the subsequent problems induced by the translation of solutions of the model back to actual sequences, proposing models and analyzing the complexity of the resulting computational problems. We find both polynomial-time and NP $$\mathcal {NP}$$ -hard special cases like planarity or bounded degree. |
---|---|
AbstractList | Scaffolding is the final step in assembling Next Generation Sequencing data, in which pre-assembled contiguous regions (“contigs”) are oriented and ordered using information that links them (for example, mapping of paired-end reads). As the genome of some species is highly repetitive, we allow placing some contigs multiple times, thereby generalizing established computational models for this problem. We study the subsequent problems induced by the translation of solutions of the model back to actual sequences, proposing models and analyzing the complexity of the resulting computational problems. We find both polynomial-time and NP $$\mathcal {NP}$$ -hard special cases like planarity or bounded degree. |
Author | Chateau, Annie Giroudeau, Rodolphe Weller, Mathias |
Author_xml | – sequence: 1 givenname: Mathias surname: Weller fullname: Weller, Mathias – sequence: 2 givenname: Annie surname: Chateau fullname: Chateau, Annie email: annie.chateau@lirmm.fr – sequence: 3 givenname: Rodolphe surname: Giroudeau fullname: Giroudeau, Rodolphe |
BookMark | eNqNkM1OwzAQhA0URFv6BhzyAoFdrxPb3FDFn1SpEoWz5ThOG6iSEpsLT0_SIiRunFaa0beamQkbNW3jGbtEuEIAea2lSikl1KlEFDJVhtQRm_Uy9eJeU8dsjDliSiT0yR8vxxEbAwFPtRR0xiYIKKWknKtzNgvhDQBQE0Cuxuxm2SRx45NF3Xjb1V821m2TtFWycraq2m0ZktWmN5p18ux33kZfJvO2ifU6XLDTym6Dn_3cKXu9v3uZP6aL5cPT_HaRrknK2Ae0qsy4FFWReScUiVwpa3PunQbryJXWoXIFV7bAwoNT3DngTvQIVxJpyvjhb9gNOXxnirZ9DwbBDGuZvroh05c3-2XMsFYPiQO069qPTx-i8QPlfBM7u3Ubu4u-CyYnIC3BCACTcfwvlmWaZ5p-sW-PX3sG |
ContentType | Book Chapter |
Copyright | Springer International Publishing AG 2017 |
Copyright_xml | – notice: Springer International Publishing AG 2017 |
DBID | FFUUA |
DEWEY | 520.9809024 |
DOI | 10.1007/978-3-319-71147-8_38 |
DatabaseName | ProQuest Ebook Central - Book Chapters - Demo use only |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science Astronomy & Astrophysics |
EISBN | 9783319711478 3319711474 |
EISSN | 1611-3349 |
Editor | Du, Hongwei Han, Meng Gao, Xiaofeng |
Editor_xml | – sequence: 1 fullname: Han, Meng – sequence: 2 fullname: Du, Hongwei – sequence: 3 fullname: Gao, Xiaofeng |
EndPage | 517 |
ExternalDocumentID | EBC6303970_400_521 EBC5592593_400_521 |
GroupedDBID | 0D6 0DA 38. AABBV AALVI ABBVZ ABHTH ABQUB ACDJR ADCXD AEDXK AEJLV AEKFX AETDV AEZAY AGIGN AGYGE AIODD ALBAV ALMA_UNASSIGNED_HOLDINGS AZZ BATQV BBABE CVWCR CZZ FFUUA I4C IEZ SBO SWYDZ TPJZQ TSXQS Z81 Z83 Z88 -DT -GH -~X 1SB 29L 2HA 2HV 5QI 875 AASHB ABMNI ACGFS AEFIE EJD F5P FEDTE HVGLF LAS LDH P2P RIG RNI RSU SVGTG VI1 ~02 |
ID | FETCH-LOGICAL-g377t-33a8d5274fb5ec4834688aa62ec90ac3cdac18cb28ab1be0c82cc02c427428713 |
ISBN | 9783319711461 3319711466 |
ISSN | 0302-9743 |
IngestDate | Tue Jul 29 20:14:57 EDT 2025 Mon Apr 07 01:45:53 EDT 2025 Wed May 28 23:24:16 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
LCCallNum | QA76.9.A43QA76.9.M35 |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-g377t-33a8d5274fb5ec4834688aa62ec90ac3cdac18cb28ab1be0c82cc02c427428713 |
Notes | Original Abstract: Scaffolding is the final step in assembling Next Generation Sequencing data, in which pre-assembled contiguous regions (“contigs”) are oriented and ordered using information that links them (for example, mapping of paired-end reads). As the genome of some species is highly repetitive, we allow placing some contigs multiple times, thereby generalizing established computational models for this problem. We study the subsequent problems induced by the translation of solutions of the model back to actual sequences, proposing models and analyzing the complexity of the resulting computational problems. We find both polynomial-time and NP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {NP}$$\end{document}-hard special cases like planarity or bounded degree. |
OCLC | 1017773628 |
PQID | EBC5592593_400_521 |
PageCount | 9 |
ParticipantIDs | springer_books_10_1007_978_3_319_71147_8_38 proquest_ebookcentralchapters_6303970_400_521 proquest_ebookcentralchapters_5592593_400_521 |
PublicationCentury | 2000 |
PublicationDate | 2017 |
PublicationDateYYYYMMDD | 2017-01-01 |
PublicationDate_xml | – year: 2017 text: 2017 |
PublicationDecade | 2010 |
PublicationPlace | Switzerland |
PublicationPlace_xml | – name: Switzerland – name: Cham |
PublicationSeriesSubtitle | Theoretical Computer Science and General Issues |
PublicationSeriesTitle | Lecture Notes in Computer Science |
PublicationSeriesTitleAlternate | Lect.Notes Computer |
PublicationSubtitle | 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II |
PublicationTitle | Combinatorial Optimization and Applications |
PublicationYear | 2017 |
Publisher | Springer International Publishing AG Springer International Publishing |
Publisher_xml | – name: Springer International Publishing AG – name: Springer International Publishing |
RelatedPersons | Kleinberg, Jon M. Mattern, Friedemann Naor, Moni Mitchell, John C. Terzopoulos, Demetri Steffen, Bernhard Pandu Rangan, C. Kanade, Takeo Kittler, Josef Weikum, Gerhard Hutchison, David Tygar, Doug |
RelatedPersons_xml | – sequence: 1 givenname: David surname: Hutchison fullname: Hutchison, David – sequence: 2 givenname: Takeo surname: Kanade fullname: Kanade, Takeo – sequence: 3 givenname: Josef surname: Kittler fullname: Kittler, Josef – sequence: 4 givenname: Jon M. surname: Kleinberg fullname: Kleinberg, Jon M. – sequence: 5 givenname: Friedemann surname: Mattern fullname: Mattern, Friedemann – sequence: 6 givenname: John C. surname: Mitchell fullname: Mitchell, John C. – sequence: 7 givenname: Moni surname: Naor fullname: Naor, Moni – sequence: 8 givenname: C. surname: Pandu Rangan fullname: Pandu Rangan, C. – sequence: 9 givenname: Bernhard surname: Steffen fullname: Steffen, Bernhard – sequence: 10 givenname: Demetri surname: Terzopoulos fullname: Terzopoulos, Demetri – sequence: 11 givenname: Doug surname: Tygar fullname: Tygar, Doug – sequence: 12 givenname: Gerhard surname: Weikum fullname: Weikum, Gerhard |
SSID | ssj0001930068 ssj0002792 |
Score | 2.0893967 |
Snippet | Scaffolding is the final step in assembling Next Generation Sequencing data, in which pre-assembled contiguous regions (“contigs”) are oriented and ordered... |
SourceID | springer proquest |
SourceType | Publisher |
StartPage | 509 |
Title | On the Linearization of Scaffolds Sharing Repeated Contigs |
URI | http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=5592593&ppg=521 http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=6303970&ppg=521 http://link.springer.com/10.1007/978-3-319-71147-8_38 |
Volume | 10628 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Nb9QwELVguSAOLQXUQkE-IC4oKInjOOltWy1UFbCXFvVm2ROnQmITRNID_HpmkribRCuhcomiKIksP3-9N35jxt7mIGNTGBMA5Z1NyjIKrMshUEgepM0tzsGkd3z5mp5fJRfX8np7KmDnLmntB_iz01fyP6jiM8SVXLL3QPbup_gA7xFfvCLCeJ0tfqcya59XoN4gqyXOTKL3Grv-ZvBUdgGB5SgyPW4X635fI3JQbOP-A3KugCnL-kfRdDmc-015P3GgJgW4rtrvNxOBIFIzgcALhDOJcaRyLT9NSKXAXqnIrBxNRkkyW-4cc8fbLMgSRd_izKf7rC3TFNeyt0PPUlyvTs9SnEpzFWocUrSkxAAPVSYX7NFydfH521Y0ywV5Wsij4wuZ9lmUtoUe-SN3lWnCJGbB725NcbnPnpDPhJMBBEv5lD1w1QE7XDYUm6g3v_k73t330lNzwPb8ARx8GI-fsZN1xRFMPgGT1yW_A5MPYHIPJh_AfM6uPq4uz86D4TCM4EYo1QZCmKyQsUpKKx2QBJxmmTFp7CAPDQgoDEQZ2DgzNrIuhCwGCGNIKBaPrFi8YIuqrtwh41EpQ8hLl-aQJFAI7JDOIC8QaaFMEsdHLPBVpLuQ_bBPGPoKaTSyUGTNwoP1z_dn4B6x977eNb3eaJ87GwHTQiNgugNME2Av7_n3V-zxthccs0X769a9xoVja98MzekvGbRp5A |
linkProvider | Library Specific Holdings |
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=bookitem&rft.title=Combinatorial+Optimization+and+Applications&rft.atitle=On+the+Linearization+of+Scaffolds+Sharing+Repeated+Contigs&rft.date=2017-01-01&rft.pub=Springer+International+Publishing+AG&rft.isbn=9783319711461&rft.volume=10628&rft_id=info:doi/10.1007%2F978-3-319-71147-8_38&rft.externalDBID=521&rft.externalDocID=EBC6303970_400_521 |
thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F5592593-l.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F6303970-l.jpg |