Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs

The merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes. In the first part of the paper we propose a new algorithm for merging succinct representations of de Bruijn graphs . Our algorithm has the same asymptotic cost of t...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 84; číslo 3; s. 639 - 669
Hlavní autoři:	Egidi, Lavinia, Louza, Felipe A., Manzini, Giovanni
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.03.2022 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Asymptotic properties Computer Science Computer Systems Organization and Communication Networks Data structures Data Structures and Information Theory Graph theory Graphical representations Graphs Mathematics of Computing Special Issue from London Stringology Days & London Algorithmic Workshop Theory of Computation Succinct data structures Space efficient algorithms de Bruijn graphs Wheeler graphs BWT variants
ISSN:	0178-4617, 1432-0541
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 merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes. In the first part of the paper we propose a new algorithm for merging succinct representations of de Bruijn graphs . Our algorithm has the same asymptotic cost of the state of the art algorithm for the same problem but it uses less than half of its working space. A novel important feature of our algorithm, not found in any of the existing tools, is that it can compute the Variable Order succinct representation of the union graph within the same asymptotic time/space bounds. In the second part of the paper we consider the more general problem of merging succinct representations of Wheeler graphs , a recently introduced graph family which includes as special cases de Bruijn graphs and many other known succinct indexes based on the BWT or one of its variants. In this paper we provide a space efficient algorithm for Wheeler graph merging; our algorithm works under the assumption that the union of the input Wheeler graphs has an ordering that satisfies the Wheeler conditions and which is compatible with the ordering of the original graphs.
AbstractList	The merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes. In the first part of the paper we propose a new algorithm for merging succinct representations of de Bruijn graphs. Our algorithm has the same asymptotic cost of the state of the art algorithm for the same problem but it uses less than half of its working space. A novel important feature of our algorithm, not found in any of the existing tools, is that it can compute the Variable Order succinct representation of the union graph within the same asymptotic time/space bounds. In the second part of the paper we consider the more general problem of merging succinct representations of Wheeler graphs, a recently introduced graph family which includes as special cases de Bruijn graphs and many other known succinct indexes based on the BWT or one of its variants. In this paper we provide a space efficient algorithm for Wheeler graph merging; our algorithm works under the assumption that the union of the input Wheeler graphs has an ordering that satisfies the Wheeler conditions and which is compatible with the ordering of the original graphs. The merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes. In the first part of the paper we propose a new algorithm for merging succinct representations of de Bruijn graphs . Our algorithm has the same asymptotic cost of the state of the art algorithm for the same problem but it uses less than half of its working space. A novel important feature of our algorithm, not found in any of the existing tools, is that it can compute the Variable Order succinct representation of the union graph within the same asymptotic time/space bounds. In the second part of the paper we consider the more general problem of merging succinct representations of Wheeler graphs , a recently introduced graph family which includes as special cases de Bruijn graphs and many other known succinct indexes based on the BWT or one of its variants. In this paper we provide a space efficient algorithm for Wheeler graph merging; our algorithm works under the assumption that the union of the input Wheeler graphs has an ordering that satisfies the Wheeler conditions and which is compatible with the ordering of the original graphs.
Author	Louza, Felipe A. Manzini, Giovanni Egidi, Lavinia
Author_xml	– sequence: 1 givenname: Lavinia surname: Egidi fullname: Egidi, Lavinia organization: University of Eastern Piedmont – sequence: 2 givenname: Felipe A. orcidid: 0000-0003-2931-1470 surname: Louza fullname: Louza, Felipe A. email: louza@ufu.br organization: Federal University of Uberlândia – sequence: 3 givenname: Giovanni surname: Manzini fullname: Manzini, Giovanni organization: University of Pisa
BookMark	eNp9kE1LAzEURYNUsFb_gKuA6-jL98xG0FKrUHGh4jLMZF7aKTVTk3bhv3d0Cu5cPbjccx-cUzKKXURCLjhccQB7nQGUlgwEZwCF1kwckTFXUjDQio_IGLgtmDLcnpDTnNcAXNjSjMnNy7bySGchtL7FuKNPmJZtXNIu0AbpXdq360jnqdquMq1iQ99XiBtMh-iMHIdqk_H8cCfk7X72On1gi-f54_R2wbzkasdsrUE0pZW1BxPAVsJK7XVhbOWtL5VEC6HmpfIF-uC1MqZW2NQlt6FRRSkn5HLY3abuc49559bdPsX-pRNGllob069PiBhaPnU5Jwxum9qPKn05Du7Hkxs8ud6T-_XkRA_JAcp9OS4x_U3_Q30DEcxq0w
Cites_doi	10.1007/s00453-011-9535-0 10.1093/bioinformatics/btx067 10.1007/s11786-016-0281-1 10.1145/2649387.2649431 10.1145/1290672.1290680 10.1007/978-3-642-33122-0_18 10.1093/bioinformatics/btu014 10.1142/S0129054118430037 10.1137/1.9781611975994.55 10.1007/978-3-319-67428-5_15 10.1016/j.tcs.2019.11.001 10.1145/1240233.1240243 10.1093/bioinformatics/btu756 10.1093/bioinformatics/btu584 10.1093/bioinformatics/btz350 10.1109/DCC.2019.00020 10.1016/j.tcs.2017.06.016 10.1038/ng.1028 10.1016/j.tcs.2017.02.020 10.1109/DCC.2016.17 10.1101/138016 10.1186/s13015-019-0140-0 10.1016/j.tcs.2007.07.014 10.1137/1.9781611974768.2 10.1137/1.9781611976465.153 10.1007/978-3-030-32686-9_24 10.1109/DCC.2015.70 10.1016/0020-0190(79)90002-4 10.1073/pnas.171285098 10.1186/1748-7188-8-22 10.1007/978-3-030-00479-8_1 10.1145/1082036.1082039 10.1145/1868237.1868248 10.1109/DCC.2019.00022 10.1145/1613676.1613680
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
DBID	AAYXX CITATION JQ2
DOI	10.1007/s00453-021-00855-2
DatabaseName	CrossRef ProQuest Computer Science Collection
DatabaseTitle	CrossRef ProQuest Computer Science Collection
DatabaseTitleList	ProQuest Computer Science Collection
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1432-0541
EndPage	669
ExternalDocumentID	10_1007_s00453_021_00855_2
GrantInformation_xml	– fundername: Ministero dell’Istruzione, dell’Università e della Ricerca grantid: 2017WR7SHH; 2017WR7SHH funderid: http://dx.doi.org/10.13039/501100003407 – fundername: Fundação de Amparo à Pesquisa do Estado de São Paulo grantid: 2017/09105-0; 2018/21509-2 funderid: http://dx.doi.org/10.13039/501100001807 – fundername: Università degli Studi del Piemonte Orientale grantid: HySecEn; LSBC_19-21 funderid: http://dx.doi.org/10.13039/501100005699 – fundername: Istituto Nazionale di Alta Matematica “Francesco Severi” grantid: MFAIS-IoT; MFAIS-IoT funderid: http://dx.doi.org/10.13039/100009112
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION JQ2
ID	FETCH-LOGICAL-c314t-7b502d973bc06f07a2735c5867ac7c943e70fb194c8ecfc5466b4edb917fd4893
IEDL.DBID	RSV
ISICitedReferencesCount	3
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000673174900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-4617
IngestDate	Thu Oct 02 16:27:21 EDT 2025 Sat Nov 29 02:20:30 EST 2025 Fri Feb 21 02:47:11 EST 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Succinct data structures Space efficient algorithms de Bruijn graphs Wheeler graphs BWT variants
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c314t-7b502d973bc06f07a2735c5867ac7c943e70fb194c8ecfc5466b4edb917fd4893
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0003-2931-1470
OpenAccessLink	http://hdl.handle.net/11568/1105890
PQID	2639556697
PQPubID	2043795
PageCount	31
ParticipantIDs	proquest_journals_2639556697 crossref_primary_10_1007_s00453_021_00855_2 springer_journals_10_1007_s00453_021_00855_2
PublicationCentury	2000
PublicationDate	2022-03-01
PublicationDateYYYYMMDD	2022-03-01
PublicationDate_xml	– month: 03 year: 2022 text: 2022-03-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Algorithmica
PublicationTitleAbbrev	Algorithmica
PublicationYear	2022
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2), 20 (2007) Muggli, M.D., Boucher, C.: Succinct de Bruijn graph construction for massive populations through space-efficient merging. bioRxiv (2017). 10.1101/229641 Egidi, L., Manzini, G.: Lightweight BWT and LCP merging via the Gap algorithm. In: SPIRE. LNCS, vol. 10508, pp. 176–190. Springer (2017) Almodaresi, F., Pandey, P., Patro, R.: Rainbowfish: A succinct colored de Bruijn graph representation. In: WABI. LIPIcs, vol. 88, pp. 18:1–18:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017) Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Tech. rep, Digital SRC Research Report (1994) HoltJMcMillanLMerging of multi-string BWTs with applicationsBioinformatics201430243524353110.1093/bioinformatics/btu584 MarcusSLeeHSchatzMCSplitmem: a graphical algorithm for pan-genome analysis with suffix skipsBioinformatics201430243476348310.1093/bioinformatics/btu756 Gibney, D., Thankachan, S.V.: On the Hardness and Inapproximability of Recognizing Wheeler Graphs. In: ESA. LIPIcs, vol. 144, pp. 51:1–51:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019) FerraginaPManziniGIndexing compressed textJ. ACM2005524552581216463210.1145/1082036.1082039 MuggliMDBoweANoyesNRMorleyPSBelkKERaymondRGagieTPuglisiSJBoucherCSuccinct colored de Bruijn graphsBioinformatics201733203181318710.1093/bioinformatics/btx067 Holt, J., McMillan, L.: Constructing Burrows-Wheeler transforms of large string collections via merging. In: BCB. pp. 464–471. ACM (2014) IqbalZCaccamoMTurnerIFlicekPMcVeanGDe novo assembly and genotyping of variants using colored de Bruijn graphsNat. Genet.201244222623210.1038/ng.1028 Egidi, L., Louza, F.A., Manzini, G.: Space-efficient merging of succinct de Bruijn graphs. In: SPIRE. LNCS, vol. 11811, pp. 337–351. Springer (2019) MuggliMDAlipanahiBBoucherCBuilding large updatable colored de Bruijn graphs via mergingBioinformatics20193514i51i6010.1093/bioinformatics/btz350 Ferragina, P., Gagie, T., Manzini, G.: Lightweight data indexing and compression in external memory. Algorithmica (2011) GagieTManziniGSirénJWheeler graphs: A framework for bwt-based data structuresTheor. Comput. Sci.20176986778371936410.1016/j.tcs.2017.06.016 Egidi, L., Louza, F.A., Manzini, G., Telles, G.P.: External memory BWT and LCP computation for sequence collections with applications. In: WABI. LIPIcs, vol. 113, pp. 10:1–10:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018) AspvallBPlassMFTarjanREA linear-time algorithm for testing the truth of certain quantified boolean formulasInf. Process. Lett.19798312112352645110.1016/0020-0190(79)90002-4 Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de Bruijn graphs. In: WABI. LNCS, vol. 7534, pp. 225–235. Springer, Berlin (2012) Gagie, T., Gourdel, G., Manzini, G.: Compressing and indexing aligned readsets. In: WABI. LIPIcs, vol. 201. pp. 13:1–13:21, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2021) EgidiLLouzaFAManziniGTellesGPExternal memory BWT and LCP computation for sequence collections with applicationsAlgorith. Mol. Biol.20191416:16:1510.1186/s13015-019-0140-0 FerraginaPVenturiniRThe compressed permuterm indexACM Trans. Algori.20107110:110:21274712710.1145/1868237.1868248 Sirén, J.: Indexing variation graphs. In: ALENEX. pp. 13–27. SIAM (2017) Alanko, J.N., Gagie, T., Navarro, G., Seelbach Benkner, L.: Tunneling on wheeler graphs. In: DCC. pp. 122–131. IEEE (2019) PevznerPATangHWatermanMSAn eulerian path approach to dna fragment assemblyProc. Natl. Acad. Sci.2001981797489753185528710.1073/pnas.171285098 KärkkäinenJKempaDEngineering a lightweight external memory suffix array construction algorithmMath. Comput. Sci.2017112137149365501310.1007/s11786-016-0281-1 Baier, U., Dede, K.: BWT tunnel planning is hard but manageable. In: DCC. pp. 142–151. IEEE (2019) Belazzougui, D., Cunial, F.: Fully-functional bidirectional Burrows-Wheeler indexes and infinite-order de Bruijn graphs. In: CPM. LIPIcs, vol. 128, pp. 10:1–10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019) DurbinREfficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT)Bioinformatics20143091266127210.1093/bioinformatics/btu014 Alanko, J., D’Agostino, G., Policriti, A., Prezza, N.: Regular languages meet prefix sorting. In: SODA. pp. 911–930. SIAM (2020) ChikhiRRizkGSpace-efficient and exact de Bruijn graph representation based on a bloom filterAlgorith. Mol. Biol.201382210.1186/1748-7188-8-22 Boucher, C., Bowe, A., Gagie, T., Puglisi, S.J., Sadakane, K.: Variable-order de Bruijn graphs. In: DCC. pp. 383–392. IEEE (2015) Alipanahi, B., Kuhnle, A., Boucher, C.: Recoloring the colored de Bruijn graph. In: SPIRE. LNCS, vol. 11147, pp. 1–11. Springer (2018) EgidiLManziniGLightweight merging of compressed indices based on BWT variantsTheor. Comput. Sci.2020812214229406678710.1016/j.tcs.2019.11.001 Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57, 4:1–4:33 (2009) BelazzouguiDGagieTMäkinenVPrevitaliMPuglisiSJBidirectional variable-order de Bruijn graphsInt. J. Found. Comput. Sci.2018290812791295389475610.1142/S0129054118430037 Sirén, J.: Burrows-Wheeler transform for Terabases. In: DCC. pp. 211–220. IEEE (2016) Cotumaccio, N., Prezza, N.: On indexing and compressing finite automata. In: SODA. SIAM (2021) Alanko, J., D’Agostino, G., Policriti, A., Prezza, N.: Wheeler languages. CoRR 2002.10303 (2020). https://arxiv.org/abs/2002.10303 MantaciSRestivoARosoneGSciortinoMAn extension of the Burrows-Wheeler transformTheor. Comput. Sci.20073873298312236457010.1016/j.tcs.2007.07.014 Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4) (2007) NaJCKimHMinSParkHLecroqTLéonardMMouchardLParkKFM-index of alignment with gapsTheor. Comput. Sci.2018710148157375861010.1016/j.tcs.2017.02.020 BelazzouguiDNavarroGOptimal lower and upper bounds for representing sequencesACM T. Algorithms201511431:131:2133612161398.68103 855_CR22 MD Muggli (855_CR38) 2017; 33 855_CR43 D Belazzougui (855_CR10) 2018; 29 855_CR20 855_CR42 855_CR41 R Chikhi (855_CR14) 2013; 8 P Ferragina (855_CR26) 2010; 7 S Marcus (855_CR35) 2014; 30 T Gagie (855_CR28) 2017; 698 855_CR29 P Ferragina (855_CR23) 2005; 52 855_CR27 855_CR25 855_CR24 R Durbin (855_CR16) 2014; 30 855_CR2 855_CR3 855_CR4 855_CR5 855_CR1 855_CR12 L Egidi (855_CR19) 2019; 14 855_CR11 855_CR30 855_CR7 JC Na (855_CR39) 2018; 710 855_CR9 855_CR18 855_CR17 J Kärkkäinen (855_CR33) 2017; 11 L Egidi (855_CR21) 2020; 812 855_CR15 855_CR37 855_CR13 MD Muggli (855_CR36) 2019; 35 S Mantaci (855_CR34) 2007; 387 J Holt (855_CR31) 2014; 30 Z Iqbal (855_CR32) 2012; 44 B Aspvall (855_CR6) 1979; 8 D Belazzougui (855_CR8) 2015; 11 PA Pevzner (855_CR40) 2001; 98
References_xml	– reference: BelazzouguiDNavarroGOptimal lower and upper bounds for representing sequencesACM T. Algorithms201511431:131:2133612161398.68103 – reference: FerraginaPVenturiniRThe compressed permuterm indexACM Trans. Algori.20107110:110:21274712710.1145/1868237.1868248 – reference: Alipanahi, B., Kuhnle, A., Boucher, C.: Recoloring the colored de Bruijn graph. In: SPIRE. LNCS, vol. 11147, pp. 1–11. Springer (2018) – reference: Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2), 20 (2007) – reference: Cotumaccio, N., Prezza, N.: On indexing and compressing finite automata. In: SODA. SIAM (2021) – reference: PevznerPATangHWatermanMSAn eulerian path approach to dna fragment assemblyProc. Natl. Acad. Sci.2001981797489753185528710.1073/pnas.171285098 – reference: AspvallBPlassMFTarjanREA linear-time algorithm for testing the truth of certain quantified boolean formulasInf. Process. Lett.19798312112352645110.1016/0020-0190(79)90002-4 – reference: MarcusSLeeHSchatzMCSplitmem: a graphical algorithm for pan-genome analysis with suffix skipsBioinformatics201430243476348310.1093/bioinformatics/btu756 – reference: MuggliMDAlipanahiBBoucherCBuilding large updatable colored de Bruijn graphs via mergingBioinformatics20193514i51i6010.1093/bioinformatics/btz350 – reference: Belazzougui, D., Cunial, F.: Fully-functional bidirectional Burrows-Wheeler indexes and infinite-order de Bruijn graphs. In: CPM. LIPIcs, vol. 128, pp. 10:1–10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019) – reference: Alanko, J., D’Agostino, G., Policriti, A., Prezza, N.: Wheeler languages. CoRR 2002.10303 (2020). https://arxiv.org/abs/2002.10303 – reference: Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de Bruijn graphs. In: WABI. LNCS, vol. 7534, pp. 225–235. Springer, Berlin (2012) – reference: Baier, U., Dede, K.: BWT tunnel planning is hard but manageable. In: DCC. pp. 142–151. IEEE (2019) – reference: Boucher, C., Bowe, A., Gagie, T., Puglisi, S.J., Sadakane, K.: Variable-order de Bruijn graphs. In: DCC. pp. 383–392. IEEE (2015) – reference: Gagie, T., Gourdel, G., Manzini, G.: Compressing and indexing aligned readsets. In: WABI. LIPIcs, vol. 201. pp. 13:1–13:21, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2021) – reference: Ferragina, P., Gagie, T., Manzini, G.: Lightweight data indexing and compression in external memory. Algorithmica (2011) – reference: Sirén, J.: Indexing variation graphs. In: ALENEX. pp. 13–27. SIAM (2017) – reference: Egidi, L., Louza, F.A., Manzini, G., Telles, G.P.: External memory BWT and LCP computation for sequence collections with applications. In: WABI. LIPIcs, vol. 113, pp. 10:1–10:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018) – reference: EgidiLLouzaFAManziniGTellesGPExternal memory BWT and LCP computation for sequence collections with applicationsAlgorith. Mol. Biol.20191416:16:1510.1186/s13015-019-0140-0 – reference: HoltJMcMillanLMerging of multi-string BWTs with applicationsBioinformatics201430243524353110.1093/bioinformatics/btu584 – reference: Alanko, J., D’Agostino, G., Policriti, A., Prezza, N.: Regular languages meet prefix sorting. In: SODA. pp. 911–930. SIAM (2020) – reference: MantaciSRestivoARosoneGSciortinoMAn extension of the Burrows-Wheeler transformTheor. Comput. Sci.20073873298312236457010.1016/j.tcs.2007.07.014 – reference: MuggliMDBoweANoyesNRMorleyPSBelkKERaymondRGagieTPuglisiSJBoucherCSuccinct colored de Bruijn graphsBioinformatics201733203181318710.1093/bioinformatics/btx067 – reference: GagieTManziniGSirénJWheeler graphs: A framework for bwt-based data structuresTheor. Comput. Sci.20176986778371936410.1016/j.tcs.2017.06.016 – reference: Egidi, L., Louza, F.A., Manzini, G.: Space-efficient merging of succinct de Bruijn graphs. In: SPIRE. LNCS, vol. 11811, pp. 337–351. Springer (2019) – reference: Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. J. ACM 57, 4:1–4:33 (2009) – reference: Sirén, J.: Burrows-Wheeler transform for Terabases. In: DCC. pp. 211–220. IEEE (2016) – reference: Holt, J., McMillan, L.: Constructing Burrows-Wheeler transforms of large string collections via merging. In: BCB. pp. 464–471. ACM (2014) – reference: Almodaresi, F., Pandey, P., Patro, R.: Rainbowfish: A succinct colored de Bruijn graph representation. In: WABI. LIPIcs, vol. 88, pp. 18:1–18:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017) – reference: IqbalZCaccamoMTurnerIFlicekPMcVeanGDe novo assembly and genotyping of variants using colored de Bruijn graphsNat. Genet.201244222623210.1038/ng.1028 – reference: DurbinREfficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT)Bioinformatics20143091266127210.1093/bioinformatics/btu014 – reference: Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4) (2007) – reference: FerraginaPManziniGIndexing compressed textJ. ACM2005524552581216463210.1145/1082036.1082039 – reference: Muggli, M.D., Boucher, C.: Succinct de Bruijn graph construction for massive populations through space-efficient merging. bioRxiv (2017). 10.1101/229641 – reference: Gibney, D., Thankachan, S.V.: On the Hardness and Inapproximability of Recognizing Wheeler Graphs. In: ESA. LIPIcs, vol. 144, pp. 51:1–51:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019) – reference: EgidiLManziniGLightweight merging of compressed indices based on BWT variantsTheor. Comput. Sci.2020812214229406678710.1016/j.tcs.2019.11.001 – reference: BelazzouguiDGagieTMäkinenVPrevitaliMPuglisiSJBidirectional variable-order de Bruijn graphsInt. J. Found. Comput. Sci.2018290812791295389475610.1142/S0129054118430037 – reference: Egidi, L., Manzini, G.: Lightweight BWT and LCP merging via the Gap algorithm. In: SPIRE. LNCS, vol. 10508, pp. 176–190. Springer (2017) – reference: Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Tech. rep, Digital SRC Research Report (1994) – reference: ChikhiRRizkGSpace-efficient and exact de Bruijn graph representation based on a bloom filterAlgorith. Mol. Biol.201382210.1186/1748-7188-8-22 – reference: KärkkäinenJKempaDEngineering a lightweight external memory suffix array construction algorithmMath. Comput. Sci.2017112137149365501310.1007/s11786-016-0281-1 – reference: NaJCKimHMinSParkHLecroqTLéonardMMouchardLParkKFM-index of alignment with gapsTheor. Comput. Sci.2018710148157375861010.1016/j.tcs.2017.02.020 – reference: Alanko, J.N., Gagie, T., Navarro, G., Seelbach Benkner, L.: Tunneling on wheeler graphs. In: DCC. pp. 122–131. IEEE (2019) – ident: 855_CR22 doi: 10.1007/s00453-011-9535-0 – volume: 33 start-page: 3181 issue: 20 year: 2017 ident: 855_CR38 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btx067 – volume: 11 start-page: 137 issue: 2 year: 2017 ident: 855_CR33 publication-title: Math. Comput. Sci. doi: 10.1007/s11786-016-0281-1 – ident: 855_CR37 – ident: 855_CR30 doi: 10.1145/2649387.2649431 – ident: 855_CR41 doi: 10.1145/1290672.1290680 – ident: 855_CR12 doi: 10.1007/978-3-642-33122-0_18 – volume: 30 start-page: 1266 issue: 9 year: 2014 ident: 855_CR16 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btu014 – volume: 29 start-page: 1279 issue: 08 year: 2018 ident: 855_CR10 publication-title: Int. J. Found. Comput. Sci. doi: 10.1142/S0129054118430037 – ident: 855_CR1 doi: 10.1137/1.9781611975994.55 – volume: 11 start-page: 31:1 issue: 4 year: 2015 ident: 855_CR8 publication-title: ACM T. Algorithms – ident: 855_CR20 doi: 10.1007/978-3-319-67428-5_15 – volume: 812 start-page: 214 year: 2020 ident: 855_CR21 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2019.11.001 – ident: 855_CR24 doi: 10.1145/1240233.1240243 – volume: 30 start-page: 3476 issue: 24 year: 2014 ident: 855_CR35 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btu756 – ident: 855_CR29 – ident: 855_CR27 – volume: 30 start-page: 3524 issue: 24 year: 2014 ident: 855_CR31 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btu584 – volume: 35 start-page: i51 issue: 14 year: 2019 ident: 855_CR36 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btz350 – ident: 855_CR3 doi: 10.1109/DCC.2019.00020 – volume: 698 start-page: 67 year: 2017 ident: 855_CR28 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2017.06.016 – volume: 44 start-page: 226 issue: 2 year: 2012 ident: 855_CR32 publication-title: Nat. Genet. doi: 10.1038/ng.1028 – volume: 710 start-page: 148 year: 2018 ident: 855_CR39 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2017.02.020 – ident: 855_CR2 – ident: 855_CR42 doi: 10.1109/DCC.2016.17 – ident: 855_CR5 doi: 10.1101/138016 – ident: 855_CR13 – volume: 14 start-page: 6:1 issue: 1 year: 2019 ident: 855_CR19 publication-title: Algorith. Mol. Biol. doi: 10.1186/s13015-019-0140-0 – volume: 387 start-page: 298 issue: 3 year: 2007 ident: 855_CR34 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2007.07.014 – ident: 855_CR43 doi: 10.1137/1.9781611974768.2 – ident: 855_CR15 doi: 10.1137/1.9781611976465.153 – ident: 855_CR9 – ident: 855_CR17 doi: 10.1007/978-3-030-32686-9_24 – ident: 855_CR18 doi: 10.1186/s13015-019-0140-0 – ident: 855_CR11 doi: 10.1109/DCC.2015.70 – volume: 8 start-page: 121 issue: 3 year: 1979 ident: 855_CR6 publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(79)90002-4 – volume: 98 start-page: 9748 issue: 17 year: 2001 ident: 855_CR40 publication-title: Proc. Natl. Acad. Sci. doi: 10.1073/pnas.171285098 – volume: 8 start-page: 22 year: 2013 ident: 855_CR14 publication-title: Algorith. Mol. Biol. doi: 10.1186/1748-7188-8-22 – ident: 855_CR4 doi: 10.1007/978-3-030-00479-8_1 – volume: 52 start-page: 552 issue: 4 year: 2005 ident: 855_CR23 publication-title: J. ACM doi: 10.1145/1082036.1082039 – volume: 7 start-page: 10:1 issue: 1 year: 2010 ident: 855_CR26 publication-title: ACM Trans. Algori. doi: 10.1145/1868237.1868248 – ident: 855_CR7 doi: 10.1109/DCC.2019.00022 – ident: 855_CR25 doi: 10.1145/1613676.1613680
SSID	ssj0012796
Score	2.327322
Snippet	The merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes. In the first part of...
SourceID	proquest crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	639
SubjectTerms	Algorithm Analysis and Problem Complexity Algorithms Asymptotic properties Computer Science Computer Systems Organization and Communication Networks Data structures Data Structures and Information Theory Graph theory Graphical representations Graphs Mathematics of Computing Special Issue from London Stringology Days & London Algorithmic Workshop Theory of Computation
Title	Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
URI	https://link.springer.com/article/10.1007/s00453-021-00855-2 https://www.proquest.com/docview/2639556697
Volume	84
WOSCitedRecordID	wos000673174900001&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: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3LSsNAFL2IunBjfWK1yizc6UAek8xkI4i0utAiVkt3Q-YRqItUkur3e2eatCi6UMgqGYZw5nHPcOeeA3CepirSmsU00caJageKZjhNqI2DyBRWWOH9U8b3fDgUk0n22BSF1e1t9zYl6XfqZbGbYx8u54jHX3e5iuLGu4HhTjjDhqfReJk7iLh35XK-85RhgG5KZX7u42s4WnHMb2lRH20Gnf_95w5sN-ySXC-mwy6s2XIPOq1zA2kW8j5cjfCobEnf60dg2CEPtnJuRWRWEGMJDvj0tSS3Tsy6JnlpCO7ZGJ-q5tUBvAz6zzd3tHFSoDoO2ZxylSD0GY-VDtIi4DmSlkQnIuW55jpjseVBocKMaWF1oROGQ8isUXiWK4yTpzmE9XJW2iMgYYwxXaciYjk-oclUmIcpkhpRON2epAsXLaDybSGYIZfSyB4aidBID42MutBrMZfN4qllhKwpQZqZ8S5cthivPv_e2_Hfmp_AVuSKGfyNsh6sz6t3ewqb-mM-raszP6k-AemYws8
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1dS8MwFL2ICvri_MTp1Dz4poF-pE37IohsTtyGuDn2FtokhfnQSTv9_d5k7YaiDwp9akMoJx_nhJt7LsBlGKaelMyngVTGVNtJaYzThGrf8VSmIx3Z-injHh8MoskkfqqSwsr6tnsdkrQ79TLZzagPE3PE46-5XEVx491gyFjGMf95OF7GDjxuq3KZuvOUIUFXqTI_9_GVjlYa81tY1LJNp_G__9yFnUpdktvFdNiDNZ3vQ6Ou3ECqhXwAN0M8KmvStv4RSDukrwtTrYjMMqI0wQGfvubk3phZlyTJFcE9G_mpqF4dwkunPbrr0qqSApW-y-aUpwFCH3M_lU6YOTxB0RLIIAp5IrmMma-5k6VuzGSkZSYDhkPItErxLJcpY09zBOv5LNfHQFwfOV2GkccSfFwVp27ihihqosz49gRNuKoBFW8LwwyxtEa20AiERlhohNeEVo25qBZPKTxUTQHKzJg34brGePX5995O_tb8Ara6o35P9B4Gj6ew7ZnEBnu7rAXr8-Jdn8Gm_JhPy-LcTrBPFeHFsw
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB5ERbxYn1itugdvujSPTTa5CKKtirUUqqW3kOwD6iEtafX3O7tNWhU9iJBTsgxhdnbnG2bmG4DzMMw8IZhPAyENqbaT0RjNhCrf8aRWkYrs_JRBh3e70XAY9z518dtq9yolOe9pMCxN-aw5kbq5aHwzSMTkHzEUNoVWFC_hNWYK6U283h8s8ggetxO6zAx6ytBZl20zP8v46pqWePNbitR6nnbt__-8DVsl6iTXczPZgRWV70KtmuhAygO-B1d9DKEVaVleCRRNnlRhphiRsSZSETSE0WtO7gzJ9ZSkuSR4l6PfKspX-_DSbj3f3NNywgIVvstmlGcBbknM_Uw4oXZ4imAmEEEU8lRwETNfcUdnbsxEpIQWAcOtZUpmGONpaWhrDmA1H-fqEIjro68XYeSxFB9XxpmbuiGCnUgbPp-gDheVcpPJnEgjWVAmW9UkqJrEqibx6tCo9J-Uh2qaeIimAoSfMa_DZaXv5effpR39bfkZbPRu20nnoft4DJue6XewRWcNWJ0Vb-oE1sX7bDQtTq2tfQAO4c6X
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=Space+Efficient+Merging+of+de+Bruijn+Graphs+and+Wheeler+Graphs&rft.jtitle=Algorithmica&rft.au=Egidi+Lavinia&rft.au=Louza%2C+Felipe+A&rft.au=Manzini+Giovanni&rft.date=2022-03-01&rft.pub=Springer+Nature+B.V&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=84&rft.issue=3&rft.spage=639&rft.epage=669&rft_id=info:doi/10.1007%2Fs00453-021-00855-2&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon