:facetid:toc:\"db/conf/cpm/cpm2017.bht\"OK:facetid:toc:db/conf/cpm/cpm2017.bhtAmihood AmirAvivit LevyMoshe LewensteinRonit LubinBenny PoratCan We Recover the Cover?.CPM25:1-25:152017Conference and Workshop Papersopenconf/cpm/AmirLLLP1710.4230/LIPICS.CPM.2017.25https://doi.org/10.4230/LIPIcs.CPM.2017.25https://dblp.org/rec/conf/cpm/AmirLLLP17URL#2900969Amihood AmirAvivit LevyRonit LubinEly PoratApproximate Cover of Strings.CPM26:1-26:142017Conference and Workshop Papersopenconf/cpm/AmirLLP1710.4230/LIPICS.CPM.2017.26https://doi.org/10.4230/LIPIcs.CPM.2017.26https://dblp.org/rec/conf/cpm/AmirLLP17URL#2900970Hideo BannaiShunsuke InenagaDominik KöpplComputing All Distinct Squares in Linear Time for Integer Alphabets.CPM22:1-22:182017Conference and Workshop Papersopenconf/cpm/BannaiIK1710.4230/LIPICS.CPM.2017.22https://doi.org/10.4230/LIPIcs.CPM.2017.22https://dblp.org/rec/conf/cpm/BannaiIK17URL#2900971Jérémy BarbayCarlos OchoaSrinivasa Rao SattiSynergistic Solutions on MultiSets.CPM31:1-31:142017Conference and Workshop Papersopenconf/cpm/BarbayOS1710.4230/LIPICS.CPM.2017.31https://doi.org/10.4230/LIPIcs.CPM.2017.31https://dblp.org/rec/conf/cpm/BarbayOS17URL#2900972Djamal BelazzouguiFabio CunialRepresenting the Suffix Tree with the CDAWG.CPM7:1-7:132017Conference and Workshop Papersopenconf/cpm/BelazzouguiC1710.4230/LIPICS.CPM.2017.7https://doi.org/10.4230/LIPIcs.CPM.2017.7https://dblp.org/rec/conf/cpm/BelazzouguiC17URL#2900973Philip BillePatrick Hagge CordingJohannes Fischer 0001Inge Li GørtzLempel-Ziv Compression in a Sliding Window.CPM15:1-15:112017Conference and Workshop Papersopenconf/cpm/BilleCFG1710.4230/LIPICS.CPM.2017.15https://doi.org/10.4230/LIPIcs.CPM.2017.15https://dblp.org/rec/conf/cpm/BilleCFG17URL#2900974Philip BilleMikko Berggren EttienneInge Li GørtzHjalte Wedel VildhøjTime-Space Trade-Offs for Lempel-Ziv Compressed Indexing.CPM16:1-16:172017Conference and Workshop Papersopenconf/cpm/BilleEGV1710.4230/LIPICS.CPM.2017.16https://doi.org/10.4230/LIPIcs.CPM.2017.16https://dblp.org/rec/conf/cpm/BilleEGV17URL#2900975Philip BilleInge Li GørtzFrederik Rye SkjoldjensenDeterministic Indexing for Packed Strings.CPM6:1-6:112017Conference and Workshop Papersopenconf/cpm/BilleGS1710.4230/LIPICS.CPM.2017.6https://doi.org/10.4230/LIPIcs.CPM.2017.6https://dblp.org/rec/conf/cpm/BilleGS17URL#2900976Kirill BorozdinDmitry KosolobovMikhail RubinchikArseny M. ShurPalindromic Length in Linear Time.CPM23:1-23:122017Conference and Workshop Papersopenconf/cpm/BorozdinKRS1710.4230/LIPICS.CPM.2017.23https://doi.org/10.4230/LIPIcs.CPM.2017.23https://dblp.org/rec/conf/cpm/BorozdinKRS17URL#2900977Karl BringmannPhilip WellnitzClique-Based Lower Bounds for Parsing Tree-Adjoining Grammars.CPM12:1-12:142017Conference and Workshop Papersopenconf/cpm/BringmannW1710.4230/LIPICS.CPM.2017.12https://doi.org/10.4230/LIPIcs.CPM.2017.12https://dblp.org/rec/conf/cpm/BringmannW17URL#2900978Laurent BulteauGuillaume FertinChristian KomusiewiczBeyond Adjacency Maximization: Scaffold Filling for New String Distances.CPM27:1-27:172017Conference and Workshop Papersopenconf/cpm/BulteauFK1710.4230/LIPICS.CPM.2017.27https://doi.org/10.4230/LIPIcs.CPM.2017.27https://dblp.org/rec/conf/cpm/BulteauFK17URL#2900979Massimo CairoPaul MedvedevNidia Obscura AcostaRomeo RizziAlexandru I. TomescuOptimal Omnitig Listing for Safe and Complete Contig Assembly.CPM29:1-29:122017Conference and Workshop Papersopenconf/cpm/CairoMART1710.4230/LIPICS.CPM.2017.29https://doi.org/10.4230/LIPIcs.CPM.2017.29https://dblp.org/rec/conf/cpm/CairoMART17URL#2900980Mauro CastelliRiccardo DondiGiancarlo MauriItalo ZoppisThe Longest Filled Common Subsequence Problem.CPM14:1-14:132017Conference and Workshop Papersopenconf/cpm/CastelliDMZ1710.4230/LIPICS.CPM.2017.14https://doi.org/10.4230/LIPIcs.CPM.2017.14https://dblp.org/rec/conf/cpm/CastelliDMZ17URL#2900981Luís Felipe I. CunhaSimone DantasTravis GagieRoland WittlerLuis Antonio Brasil KowadaJens StoyeFast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings.CPM19:1-19:92017Conference and Workshop Papersopenconf/cpm/CunhaDGWKS1710.4230/LIPICS.CPM.2017.19https://doi.org/10.4230/LIPIcs.CPM.2017.19https://dblp.org/rec/conf/cpm/CunhaDGWKS17URL#2900982DiptaramaTakashi KatsuraYuhei OtomoKazuyuki NarisawaAyumi ShinoharaPosition Heaps for Parameterized Strings.CPM8:1-8:132017Conference and Workshop Papersopenconf/cpm/DiptaramaKONS1710.4230/LIPICS.CPM.2017.8https://doi.org/10.4230/LIPIcs.CPM.2017.8https://dblp.org/rec/conf/cpm/DiptaramaKONS17URL#2900983Philippe DuchonCyril NicaudCarine PivoteauGapped Pattern Statistics.CPM21:1-21:122017Conference and Workshop Papersopenconf/cpm/DuchonNP1710.4230/LIPICS.CPM.2017.21https://doi.org/10.4230/LIPIcs.CPM.2017.21https://dblp.org/rec/conf/cpm/DuchonNP17URL#2900984Bartlomiej Dudek 0001Pawel GawrychowskiPiotr Ostropolski-NalewajaA Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem.CPM10:1-10:142017Conference and Workshop Papersopenconf/cpm/DudekGO1710.4230/LIPICS.CPM.2017.10https://doi.org/10.4230/LIPIcs.CPM.2017.10https://dblp.org/rec/conf/cpm/DudekGO17URL#2900985Travis GagieMeng He 0001Gonzalo Navarro 0001Path Queries on Functions.CPM5:1-5:152017Conference and Workshop Papersopenconf/cpm/GagieHN1710.4230/LIPICS.CPM.2017.5https://doi.org/10.4230/LIPIcs.CPM.2017.5https://dblp.org/rec/conf/cpm/GagieHN17URL#2900986Roberto GrossiCostas S. IliopoulosChang Liu 0035Nadia PisantiSolon P. PissisAhmad RethaGiovanna RosoneFatima VayaniLuca VersariOn-Line Pattern Matching on Similar Texts.CPM9:1-9:142017Conference and Workshop Papersopenconf/cpm/GrossiILPPRRVV1710.4230/LIPICS.CPM.2017.9https://doi.org/10.4230/LIPIcs.CPM.2017.9https://dblp.org/rec/conf/cpm/GrossiILPPRRVV17URL#2900987Tomohiro ILongest Common Extensions with Recompression.CPM18:1-18:152017Conference and Workshop Papersopenconf/cpm/I1710.4230/LIPICS.CPM.2017.18https://doi.org/10.4230/LIPIcs.CPM.2017.18https://dblp.org/rec/conf/cpm/I17URL#2900988Artur JezRecompression of SLPs.CPM2:1-2:12017Conference and Workshop Papersopenconf/cpm/Jez1710.4230/LIPICS.CPM.2017.2https://doi.org/10.4230/LIPIcs.CPM.2017.2https://dblp.org/rec/conf/cpm/Jez17URL#2900989Christian KomusiewiczMateus de Oliveira OliveiraMeirav ZehaviRevisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping.CPM11:1-11:172017Conference and Workshop Papersopenconf/cpm/KomusiewiczOZ1710.4230/LIPICS.CPM.2017.11https://doi.org/10.4230/LIPIcs.CPM.2017.11https://dblp.org/rec/conf/cpm/KomusiewiczOZ17URL#2900990Keita KuboiYuta FujishigeShunsuke InenagaHideo BannaiMasayuki TakedaFaster STR-IC-LCS Computation via RLE.CPM20:1-20:122017Conference and Workshop Papersopenconf/cpm/KuboiFIBT1710.4230/LIPICS.CPM.2017.20https://doi.org/10.4230/LIPIcs.CPM.2017.20https://dblp.org/rec/conf/cpm/KuboiFIBT17URL#2900991Manuel LafondCéline ScornavaccaOn the Weighted Quartet Consensus Problem.CPM28:1-28:182017Conference and Workshop Papersopenconf/cpm/LafondS1710.4230/LIPICS.CPM.2017.28https://doi.org/10.4230/LIPIcs.CPM.2017.28https://dblp.org/rec/conf/cpm/LafondS17URL#2900992Giovanni ManziniWheeler Graphs: Variations on a Theme by Burrows and Wheeler.CPM1:1-1:12017Conference and Workshop Papersopenconf/cpm/Manzini1710.4230/LIPICS.CPM.2017.1https://doi.org/10.4230/LIPIcs.CPM.2017.1https://dblp.org/rec/conf/cpm/Manzini17URL#2900993Takuya MienoShunsuke InenagaHideo BannaiMasayuki TakedaTight Bounds on the Maximum Number of Shortest Unique Substrings.CPM24:1-24:112017Conference and Workshop Papersopenconf/cpm/MienoIBT1710.4230/LIPICS.CPM.2017.24https://doi.org/10.4230/LIPIcs.CPM.2017.24https://dblp.org/rec/conf/cpm/MienoIBT17URL#2900994Marcin MuchaShortest Superstring.CPM3:1-3:12017Conference and Workshop Papersopenconf/cpm/Mucha1710.4230/LIPICS.CPM.2017.3https://doi.org/10.4230/LIPIcs.CPM.2017.3https://dblp.org/rec/conf/cpm/Mucha17URL#2900995Gonzalo Navarro 0001Document Listing on Repetitive Collections with Guaranteed Performance.CPM4:1-4:132017Conference and Workshop Papersopenconf/cpm/Navarro1710.4230/LIPICS.CPM.2017.4https://doi.org/10.4230/LIPIcs.CPM.2017.4https://dblp.org/rec/conf/cpm/Navarro17URL#2900996Giulio Ermanno PibiriRossano VenturiniDynamic Elias-Fano Representation.CPM30:1-30:142017Conference and Workshop Papersopenconf/cpm/PibiriV1710.4230/LIPICS.CPM.2017.30https://doi.org/10.4230/LIPIcs.CPM.2017.30https://dblp.org/rec/conf/cpm/PibiriV17URL#2900997Alberto PolicritiNicola PrezzaFrom LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back.CPM17:1-17:102017Conference and Workshop Papersopenconf/cpm/PolicritiP1710.4230/LIPICS.CPM.2017.17https://doi.org/10.4230/LIPIcs.CPM.2017.17https://dblp.org/rec/conf/cpm/PolicritiP17URL#2900998Tatiana StarikovskayaCommunication and Streaming Complexity of Approximate Pattern Matching.CPM13:1-13:112017Conference and Workshop Papersopenconf/cpm/Starikovskaya1710.4230/LIPICS.CPM.2017.13https://doi.org/10.4230/LIPIcs.CPM.2017.13https://dblp.org/rec/conf/cpm/Starikovskaya17URL#2900999Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers.CPM0:i-0:xvi2017Conference and Workshop Papersopenconf/cpm/X1710.4230/LIPICS.CPM.2017.0https://doi.org/10.4230/LIPIcs.CPM.2017.0https://dblp.org/rec/conf/cpm/X17URL#2901000Juha KärkkäinenJakub RadoszewskiWojciech Rytter28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, PolandCPMLIPIcs78Schloss Dagstuhl - Leibniz-Zentrum für Informatik2017Editorshipopenconf/cpm/2017http://www.dagstuhl.de/dagpub/978-3-95977-039-2https://dblp.org/rec/conf/cpm/2017URL#3036366