×

Found 157 Documents (Results 1–100)

100
MathJax

Extracting the sparse longest common prefix array from the suffix binary search tree. (English) Zbl 07542418

Lecroq, Thierry (ed.) et al., String processing and information retrieval. 28th international symposium, SPIRE 2021, Lille, France, October 4–6, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12944, 143-150 (2021).
MSC:  68P05 68P10
PDF BibTeX XML Cite
Full Text: DOI

Searching long repeats in streams. (English) Zbl 07559199

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 31, 14 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Fully-functional bidirectional Burrows-Wheeler indexes and infinite-order de Bruijn graphs. (English) Zbl 07559178

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 10, 15 p. (2019).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Linear-time algorithms for the subpath kernel. (English) Zbl 07286748

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 22, 13 p. (2018).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Fast matching statistics in small space. (English) Zbl 07286690

D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 17, 14 p. (2018).
MSC:  68W32 68P05 68P30
PDF BibTeX XML Cite
Full Text: DOI

Fast label extraction in the CDAWG. (English) Zbl 1454.68038

Fici, Gabriele (ed.) et al., String processing and information retrieval. 24th international symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10508, 161-175 (2017).
MSC:  68P20 68P05 68W32
PDF BibTeX XML Cite
Full Text: DOI arXiv

Longest common factor after one edit operation. (English) Zbl 1454.68196

Fici, Gabriele (ed.) et al., String processing and information retrieval. 24th international symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10508, 14-26 (2017).
MSC:  68W32 68P05
PDF BibTeX XML Cite
Full Text: DOI

Structural pattern matching – succinctly. (English) Zbl 1457.68335

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 35, 13 p. (2017).
MSC:  68W32 68P05
PDF BibTeX XML Cite
Full Text: DOI

Optimal computation of overabundant words. (English) Zbl 1443.92133

Schwartz, Russell (ed.) et al., 17th international workshop on algorithms in bioinformatics, WABI 2017, Boston, MA, USA, August 21–23, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 88, Article 4, 14 p. (2017).
MSC:  92D20 92-08
PDF BibTeX XML Cite
Full Text: DOI arXiv

String inference from longest-common-prefix array. (English) Zbl 1441.68302

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 62, 14 p. (2017).
MSC:  68W32 68P05 68Q17
PDF BibTeX XML Cite
Full Text: DOI arXiv

Representing the suffix tree with the CDAWG. (English) Zbl 1434.68122

Kärkkäinen, Juha (ed.) et al., 28th annual symposium on combinatorial pattern matching. CPM 2017, Warsaw, Poland, July 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 78, Article 7, 13 p. (2017).
MSC:  68P05 68Q42
PDF BibTeX XML Cite
Full Text: DOI arXiv

Deterministic indexing for packed strings. (English) Zbl 1434.68123

Kärkkäinen, Juha (ed.) et al., 28th annual symposium on combinatorial pattern matching. CPM 2017, Warsaw, Poland, July 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 78, Article 6, 11 p. (2017).
MSC:  68P05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Parallel algorithms to align multiple strings in the context of web data extraction. (English) Zbl 1396.68138

Adamatzky, Andrew (ed.), Emergent computation. A Festschrift for Selim G. Akl. Cham: Springer (ISBN 978-3-319-46375-9/hbk; 978-3-319-46376-6/ebook). Emergence, Complexity and Computation 24, 525-578 (2017).
MSC:  68W32 68M11 68W10
PDF BibTeX XML Cite
Full Text: DOI

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

Variance of the internal profile in suffix trees. (English) Zbl 1411.68036

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. 12 p. (2016).
MSC:  68P05 68R15 68W32
PDF BibTeX XML Cite
Full Text: arXiv

Space-time trade-offs for the shortest unique substring problem. (English) Zbl 1398.68704

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 34, 13 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI

Efficient index for weighted sequences. (English) Zbl 1380.68461

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 4, 13 p. (2016).
MSC:  68W32 68W40
PDF BibTeX XML Cite
Full Text: DOI arXiv

A framework for dynamic parameterized dictionary matching. (English) Zbl 1378.68204

Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 10, 14 p. (2016).
MSC:  68W32 68P05
PDF BibTeX XML Cite
Full Text: DOI

What’s behind blast. (English) Zbl 1462.92043

Chauve, Cedric (ed.) et al., Models and algorithms for genome evolution. Selected contributions based on the presentations at the MAGE conference, Montréal, Canada, August 23–26, 2013. London: Springer. Comput. Biol. 19, 3-15 (2013).
MSC:  92D10 92-08
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

Forty years of text indexing. (English) Zbl 1381.68067

Fischer, Johannes (ed.) et al., Combinatorial pattern matching. 24th annual symposium, CPM 2013, Bad Herrenalb, Germany, June 17–19, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38904-7/pbk). Lecture Notes in Computer Science 7922, 1-10 (2013).
PDF BibTeX XML Cite
Full Text: DOI Link

A fast longest common subsequence algorithm for similar strings. (English) Zbl 1284.68690

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 4th international conference, LATA 2010, Trier, Germany, May 24–28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13088-5/pbk). Lecture Notes in Computer Science 6031, 82-93 (2010).
MSC:  68W32
PDF BibTeX XML Cite
Full Text: DOI

Range median of minima queries, super-Cartesian trees, and text indexing. (English) Zbl 1233.68128

Miller, Mirka (ed.) et al., Proceedings of the 19th international workshop on combinatorial algorithms, IWOCA 2008, Nagoya, Japan, September 12–15, 2008. London: College Publications (ISBN 978-1-904987-74-1/pbk). Texts in Algorithmics 12, 239-252 (2009).
MSC:  68P05 68W32
PDF BibTeX XML Cite

Storage and retrieval of individual genomes. (English) Zbl 1345.68122

Batzoglou, Serafim (ed.), Research in computational molecular biology. 13th annual international conference, RECOMB 2009, Tucson, AZ, USA, May 18–21, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02007-0/pbk). Lecture Notes in Computer Science 5541. Lecture Notes in Bioinformatics, 121-137 (2009).
PDF BibTeX XML Cite
Full Text: DOI Link

Efficient approximate dictionary look-up for long words over small alphabets. (English) Zbl 1145.68389

Correa, José R. (ed.) et al., LATIN 2006: Theoretical informatics. 7th Latin American symposium, Valdivia, Chile, March 20–24, 2006. Proceedings. Berlin: Springer (ISBN 3-540-32755-X/pbk). Lecture Notes in Computer Science 3887, 118-129 (2006).
MSC:  68P05 68Q25 68W05
PDF BibTeX XML Cite
Full Text: DOI

Factor oracles. (English) Zbl 1160.68351

Ibarra, Oscar H. (ed.) et al., Implementation and application of automata. 11th international conference, CIAA 2006, Taipei, Taiwan, August 21–23, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-37213-4/pbk). Lecture Notes in Computer Science 4094, 78-89 (2006).
PDF BibTeX XML Cite
Full Text: DOI

Efficient enumeration of phylogenetically informative substrings. (English) Zbl 1302.92086

Apostolico, Alberto (ed.) et al., Research in computational molecular biology. 10th annual international conference, RECOMB 2006, Venice, Italy, April 2–5, 2006, Proceedings. Berlin: Springer (ISBN 978-3-540-33295-4/pbk). Lecture Notes in Computer Science 3909. Lecture Notes in Bioinformatics, 248-264 (2006).
MSC:  92D15 92D10
PDF BibTeX XML Cite
Full Text: DOI

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