Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/cpm/cpm2008.bht:"
download as .bib file
@inproceedings{DBLP:conf/cpm/AmirAKLP08,
author = {Amihood Amir and
Yonatan Aumann and
Oren Kapah and
Avivit Levy and
Ely Porat},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Approximate String Matching with Address Bit Errors},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {118--129},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_13},
doi = {10.1007/978-3-540-69068-9\_13},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/AmirAKLP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Arroyuelo08,
author = {Diego Arroyuelo},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {An Improved Succinct Representation for Dynamic k-ary Trees},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {277--289},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_26},
doi = {10.1007/978-3-540-69068-9\_26},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Arroyuelo08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BergeronMS08,
author = {Anne Bergeron and
Julia Mixtacki and
Jens Stoye},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {{HP} Distance Via Double Cut and Join Distance},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {56--68},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_8},
doi = {10.1007/978-3-540-69068-9\_8},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BergeronMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BetzlerFKN08,
author = {Nadja Betzler and
Michael R. Fellows and
Christian Komusiewicz and
Rolf Niedermeier},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Parameterized Algorithms and Hardness Results for Some Graph Motif
Problems},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {31--43},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_6},
doi = {10.1007/978-3-540-69068-9\_6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BetzlerFKN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordEPP08,
author = {Rapha{\"{e}}l Clifford and
Klim Efremenko and
Benny Porat and
Ely Porat},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {A Black Box for Online Approximate Pattern Matching},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {143--151},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_15},
doi = {10.1007/978-3-540-69068-9\_15},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CliffordEPP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CrochemoreIT08,
author = {Maxime Crochemore and
Lucian Ilie and
Liviu Tinta},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Towards a Solution to the "Runs" Conjecture},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {290--302},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_27},
doi = {10.1007/978-3-540-69068-9\_27},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CrochemoreIT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Farach-ColtonH08,
author = {Martin Farach{-}Colton and
Yang Huang},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {A Linear Delay Algorithm for Building Concept Lattices},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {204--216},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_20},
doi = {10.1007/978-3-540-69068-9\_20},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Farach-ColtonH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Fayolle08,
author = {Julien Fayolle},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Analysis of the Size of Antidictionary in},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {107--117},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_12},
doi = {10.1007/978-3-540-69068-9\_12},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Fayolle08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FischerMN08,
author = {Johannes Fischer and
Veli M{\"{a}}kinen and
Gonzalo Navarro},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {An(other) Entropy-Bounded Compressed Suffix Tree},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {152--165},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_16},
doi = {10.1007/978-3-540-69068-9\_16},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/FischerMN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FraczakRY08,
author = {Wojciech Fraczak and
Wojciech Rytter and
Mohammadreza Yazdani},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Matching Integer Intervals by Minimal Sets of Binary Words with don't
cares},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {217--229},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_21},
doi = {10.1007/978-3-540-69068-9\_21},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/FraczakRY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GasieniecLZ08,
author = {Leszek Gasieniec and
Cindy Y. Li and
Meng Zhang},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Faster Algorithm for the Set Variant of the String Barcoding Problem},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {82--94},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_10},
doi = {10.1007/978-3-540-69068-9\_10},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GasieniecLZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GotthilfHL08,
author = {Zvi Gotthilf and
Danny Hermelin and
Moshe Lewenstein},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Constrained {LCS:} Hardness and Approximation},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {255--262},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_24},
doi = {10.1007/978-3-540-69068-9\_24},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GotthilfHL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Gusfield08,
author = {Dan Gusfield},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {ReCombinatorics: Combinatorial Algorithms for Studying the History
of Recombination in Populations},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {1--2},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_1},
doi = {10.1007/978-3-540-69068-9\_1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Gusfield08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/HundtL08,
author = {Christian Hundt and
Maciej Liskiewicz},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Two-Dimensional Pattern Matching with Combined Scaling and Rotation},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {5--17},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_4},
doi = {10.1007/978-3-540-69068-9\_4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/HundtL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KellerKL08,
author = {Orgad Keller and
Tsvi Kopelowitz and
Moshe Lewenstein},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {On the Longest Common Parameterized Subsequence},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {303--315},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_28},
doi = {10.1007/978-3-540-69068-9\_28},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/KellerKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KiwiNT08,
author = {Marcos A. Kiwi and
Gonzalo Navarro and
Claudio Telha},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {On-Line Approximate String Matching with Bounded Errors},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {130--142},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_14},
doi = {10.1007/978-3-540-69068-9\_14},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/KiwiNT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KolpakovK08,
author = {Roman Kolpakov and
Gregory Kucherov},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Searching for Gapped Palindromes},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {18--30},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_5},
doi = {10.1007/978-3-540-69068-9\_5},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/KolpakovK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/LiBXL08,
author = {Shuai Cheng Li and
Dongbo Bu and
Jinbo Xu and
Ming Li},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Finding Largest Well-Predicted Subset of Protein Structure Models},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {44--55},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_7},
doi = {10.1007/978-3-540-69068-9\_7},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/LiBXL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Ma08,
author = {Bin Ma},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Why Greed Works for Shortest Common Superstring Problem},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {244--254},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_23},
doi = {10.1007/978-3-540-69068-9\_23},
timestamp = {Mon, 13 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/Ma08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/MarschallR08,
author = {Tobias Marschall and
Sven Rahmann},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Probabilistic Arithmetic Automata and Their Application to Pattern
Matching Statistics},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {95--106},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_11},
doi = {10.1007/978-3-540-69068-9\_11},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/MarschallR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/MohlWB08,
author = {Mathias M{\"{o}}hl and
Sebastian Will and
Rolf Backofen},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Fixed Parameter Tractable Alignment of {RNA} Structures Including
Arbitrary Pseudoknots},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {69--81},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_9},
doi = {10.1007/978-3-540-69068-9\_9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/MohlWB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/MozesTWZ08,
author = {Shay Mozes and
Dekel Tsur and
Oren Weimann and
Michal Ziv{-}Ukelson},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Fast Algorithms for Computing Tree {LCS}},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {230--243},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_22},
doi = {10.1007/978-3-540-69068-9\_22},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/MozesTWZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Munro08,
author = {J. Ian Munro},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Lower Bounds for Succinct Data Structures},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {3},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_2},
doi = {10.1007/978-3-540-69068-9\_2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Munro08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/NittoV08,
author = {Igor Nitto and
Rossano Venturini},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {166--177},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_17},
doi = {10.1007/978-3-540-69068-9\_17},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/NittoV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/NongZC08,
author = {Ge Nong and
Sen Zhang and
Wai Hong Chan},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Computing Inverse {ST} in Linear Complexity},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {178--190},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_18},
doi = {10.1007/978-3-540-69068-9\_18},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/NongZC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Raghavan08,
author = {Prabhakar Raghavan},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {The Changing Face of Web Search},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {4},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_3},
doi = {10.1007/978-3-540-69068-9\_3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Raghavan08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/RussoNO08,
author = {Lu{\'{\i}}s M. S. Russo and
Gonzalo Navarro and
Arlindo L. Oliveira},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Dynamic Fully-Compressed Suffix Trees},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {191--203},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_19},
doi = {10.1007/978-3-540-69068-9\_19},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/RussoNO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/XiaoWLJ08,
author = {Jing Xiao and
Lusheng Wang and
Xiaowen Liu and
Tao Jiang},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Finding Additive Biclusters with Random Background},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {263--276},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_25},
doi = {10.1007/978-3-540-69068-9\_25},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/XiaoWLJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2008,
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9},
doi = {10.1007/978-3-540-69068-9},
isbn = {978-3-540-69066-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-01 16:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
