×

Found 108 Documents (Results 1–100)

100
MathJax

On the hardness and inapproximability of recognizing Wheeler graphs. (English) Zbl 07525488

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 51, 16 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Longest substring palindrome after edit. (English) Zbl 07286738

Navarro, Gonzalo (ed.) et al., 29th annual symposium on combinatorial pattern matching, CPM 2018, July 2–4, 2018, Qingdao, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 105, Article 12, 14 p. (2018).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Non-overlapping indexing – cache obliviously. (English) Zbl 07286734

Navarro, Gonzalo (ed.) et al., 29th annual symposium on combinatorial pattern matching, CPM 2018, July 2–4, 2018, Qingdao, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 105, Article 8, 9 p. (2018).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Kings, name days, lazy servants and magic. (English) Zbl 1489.68057

Ito, Hiro (ed.) et al., 9th international conference on fun with algorithms, FUN 2018, June 13–15, 2018, La Maddalena Island, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 100, Article 10, 13 p. (2018).
MSC:  68P05 68P10
PDF BibTeX XML Cite
Full Text: DOI

Small-space LCE data structure with constant-time queries. (English) Zbl 1441.68026

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 10, 15 p. (2017).
MSC:  68P05 68P30
PDF BibTeX XML Cite
Full Text: DOI arXiv

Average size of a suffix tree for Markov sources. (English) Zbl 1411.68038

Neininger, Ralph (ed.) et al., Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms – AofA’16, Kraków, Poland, July 4–8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 13 p. (2016).
MSC:  68P05 68R15
PDF BibTeX XML Cite
Full Text: arXiv

Parallel lookups in string indexes. (English) Zbl 1397.68237

Inenaga, Shunsuke (ed.) et al., String processing and information retrieval. 23rd international symposium, SPIRE 2016, Beppu, Japan, October 18–20, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-46048-2/pbk; 978-3-319-46049-9/ebook). Lecture Notes in Computer Science 9954, 61-67 (2016).
MSC:  68W32 68P05 68W10
PDF BibTeX XML Cite
Full Text: DOI

Computing DAWGs and minimal absent words in linear time for integer alphabets. (English) Zbl 1398.68703

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 38, 14 p. (2016).
MSC:  68W32 68Q25
PDF BibTeX XML Cite
Full Text: DOI

Fully-online construction of suffix trees for multiple texts. (English) Zbl 1380.68159

Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 22, 13 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI

Forbidden extension queries. (English) Zbl 1366.68029

Harsha, Prahladh (ed.) et al., 35th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2015, Bangalore, India, December 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-97-2). LIPIcs – Leibniz International Proceedings in Informatics 45, 320-335 (2015).
MSC:  68P05 68P20
PDF BibTeX XML Cite
Full Text: DOI

Faster sparse suffix sorting. (English) Zbl 1359.68338

Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 386-396 (2014).
MSC:  68W32 68P10
PDF BibTeX XML Cite
Full Text: DOI

Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction. (English) Zbl 1295.92011

Bremen: Oldenbusch Verlag; Ulm: Enno Ohlebusch (ISBN 978-3-00-041316-2/hbk). xvi, 604 p. (2013).
PDF BibTeX XML Cite

Suffix tree of alignment: an efficient index for similar data. (English) Zbl 1407.68115

Lecroq, Thierry (ed.) et al., Combinatorial algorithms. 24th international workshop, IWOCA 2013, Rouen, France, July 10–12, 2013. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8288, 337-348 (2013).
MSC:  68P05 68W32
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

On the number of 2-protected nodes in tries and suffix trees. (English) Zbl 1296.68034

Broutin, Nicolas (ed.) et al., Proceeding of the 23rd international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’12), Montreal, Canada, June 18–22, 2012. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 381-398, electronic only (2012).
MSC:  68P05 68Q87 68R05
PDF BibTeX XML Cite
Full Text: Link

Online suffix tree construction for streaming sequences. (English) Zbl 1183.68270

Sarbazi-Azad, Hamid (ed.) et al., Advances in computer science and engineering. 13th international CSI computer conference, CSICC 2008, Kish Island, Iran, March 9–11, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89984-6/pbk; 978-3-540-89985-3/ebook). Communications in Computer and Information Science 6, 69-81 (2008).
MSC:  68P25
PDF BibTeX XML Cite
Full Text: DOI

Optimal prefix and suffix queries on texts. (English) Zbl 1192.68952

2007 Conference on analysis of algorithms, AofA 07. Papers from the 13th Conference held in Juan-les-Pins, France, June 17–22, 2007. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). 45-52, electronic only (2007).
MSC:  68W40 65Y99
PDF BibTeX XML Cite
Full Text: Link

On correlation polynomials and subword complexity. (English) Zbl 1192.68961

2007 Conference on analysis of algorithms, AofA 07. Papers from the 13th Conference held in Juan-les-Pins, France, June 17–22, 2007. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). 1-18, electronic only (2007).
MSC:  68W40 65Y99 68R15
PDF BibTeX XML Cite
Full Text: Link

Factor automata of automata and applications. (English) Zbl 1139.68371

Holub, Jan (ed.) et al., Implementation and application of automata. 12th international conference, CIAA 2007, Prague, Czech Republic, July 16–18, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-76335-2/pbk). Lecture Notes in Computer Science 4783, 168-179 (2007).
MSC:  68Q45 68P05 68P20
PDF BibTeX XML Cite
Full Text: DOI Link

Reversal distance for strings with duplicates: Linear time approximation using hitting set. (English) Zbl 1129.68431

Erlebach, Thomas (ed.) et al., Approximation and online algorithms. 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14–15, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-69513-4/pbk). Lecture Notes in Computer Science 4368, 279-289 (2007).
MSC:  68P10 68W25
PDF BibTeX XML Cite
Full Text: DOI Link

Analysis of the average depth in a suffix tree under a Markov model. (English) Zbl 1104.68029

Martínez, Conrado (ed.), 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6–10, 2005. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AD, 95-103, electronic (2005).
MSC:  68P05 68W40
PDF BibTeX XML Cite

Average profiles, from tries to suffix-trees. (English) Zbl 1104.68438

Martínez, Conrado (ed.), 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6–10, 2005. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AD, 257-266, electronic (2005).
MSC:  68P05
PDF BibTeX XML Cite

Analysis of the multiplicity matching parameter in suffix trees. (English) Zbl 1104.68034

Martínez, Conrado (ed.), 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6–10, 2005. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AD, 307-321, electronic (2005).
PDF BibTeX XML Cite

A tight upper bound on the size of the antidictionary of a binary string. (English) Zbl 1099.68602

Martínez, Conrado (ed.), 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6–10, 2005. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AD, 393-398, electronic (2005).
MSC:  68P05 68P30
PDF BibTeX XML Cite
Full Text: arXiv

Indexing structures for approximate string matching. (English) Zbl 1032.68124

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 140-151 (2003).
MSC:  68R15 68Q45
PDF BibTeX XML Cite
Full Text: Link

A new algorithm for accelerating pair-wise computations of melting temperature. (English) Zbl 1417.92117

Broersma, Hajo (ed.) et al., Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6–8, 2001. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 8, 46-49 (2001).
MSC:  92D20 90C39
PDF BibTeX XML Cite
Full Text: Link

Efficient suffix trees on secondary storage. (Extended abstract). (English) Zbl 0847.68030

Proceedings of the 7th annual ACM-SIAM symposium on discrete algorithms, held in Atlanta, GA, USA, January 28-30, 1996. Philadelphia, PA: SIAM. 383-391 (1996).
MSC:  68P10 68P05
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification

all top 3

Software