×

Found 238 Documents (Results 1–100)

The complexity of approximate pattern matching on de Bruijn graphs. (English) Zbl 1494.92086

Pe’er, Itsik (ed.), Research in computational molecular biology. 26th annual international conference, RECOMB 2022, San Diego, CA, USA, May 22–25, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13278, 263-278 (2022).
MSC:  92D20 92C15 68Q17
PDF BibTeX XML Cite
Full Text: DOI arXiv

Latin hypercubes and cellular automata. (English) Zbl 07370040

Zenil, Hector (ed.), Cellular automata and discrete complex systems. 26th IFIP WG 1.5 international workshop, AUTOMATA 2020, Stockholm, Sweden, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12286, 139-151 (2020).
MSC:  68Q80
PDF BibTeX XML Cite
Full Text: DOI arXiv

Alignment- and reference-free phylogenomics with colored de Bruijn graphs. (English) Zbl 1495.92049

Huber, Katharina T. (ed.) et al., 19th international workshop on algorithms in bioinformatics, WABI 2019, Niagara Falls, NY, USA, September 8–10, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 143, Article 2, 14 p. (2019).
MSC:  92D15 05C90 92-08
PDF BibTeX XML Cite
Full Text: DOI arXiv

Reverse de Bruijn: utilizing reverse peptide synthesis to cover all amino acid \(k\)-mers. (English) Zbl 07661706

Raphael, Benjamin J. (ed.), Research in computational molecular biology. 22nd annual international conference, RECOMB 2018, Paris, France, April 21–24, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10812, 154-166 (2018).
MSC:  92D20 05C20 92-08
PDF BibTeX XML Cite
Full Text: DOI

On leaf node edge switchings in spanning trees of de Bruijn graphs. (English) Zbl 1459.05152

Ghosh, Debdas (ed.) et al., Mathematics and computing. 4th international conference, ICMC 2018, Varanasi, India, January 9–11, 2018. Revised selected papers. Singapore: Springer. Commun. Comput. Inf. Sci. 834, 110-117 (2018).
PDF BibTeX XML Cite
Full Text: DOI

Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders. (English) Zbl 1425.05065

Sobieczky, Florian (ed.), Unimodularity in randomly generated graphs. AMS special session on unimodularity in randomly generated graphs, Denver, CO, USA, October 8–9, 2016. Proceedings. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 719, 129-154 (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the power domination number of de Bruijn and Kautz digraphs. (English) Zbl 1508.05126

Brankovic, Ljiljana (ed.) et al., Combinatorial algorithms. 28th international workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17–21, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10765, 264-272 (2018).
MSC:  05C69 05C20
PDF BibTeX XML Cite
Full Text: DOI arXiv

On universal partial words. (English) Zbl 1378.05112

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 231-237 (2017).
MSC:  05C45 05C38 68R15
PDF BibTeX XML Cite
Full Text: DOI

Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing. (English) Zbl 1356.05057

de Mier, Anna (ed.) et al., Discrete mathematical days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 54, 157-162 (2016).
MSC:  05C20 05C76
PDF BibTeX XML Cite
Full Text: DOI Link

Shifted de Bruijn graphs. (English) Zbl 1327.05154

Pinto, Raquel (ed.) et al., Coding theory and applications. 4th international Castle Meeting, ICMCTA, Palmela Castle, Portugal, September 15–18, 2014. Cham: Springer (ISBN 978-3-319-17295-8/hbk; 978-3-319-17296-5/ebook). CIM Series in Mathematical Sciences 3, 195-202 (2015).
PDF BibTeX XML Cite
Full Text: DOI

Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words. (English. Russian original) Zbl 1327.68184

Cybern. Syst. Anal. 51, No. 1, 157-164 (2015); translation from Kibern. Sist. Anal. 2015, No. 1, 179-186 (2015).
PDF BibTeX XML Cite
Full Text: DOI

Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words. (English. Russian original) Zbl 1298.68208

Cybern. Syst. Anal. 50, No. 1, 148-156 (2014); translation from Kibern. Sist. Anal. 2014, No. 1, 168-177 (2014).
PDF BibTeX XML Cite
Full Text: DOI

Critical groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields. (English) Zbl 1293.05155

Nešetřil, Jaroslav (ed.) et al., The seventh European conference on combinatorics, graph theory and applications. Extended abstracts of EuroComb 2013, Pisa, Italy, September 9–13, 2013. Pisa: Edizioni della Normale (ISBN 978-88-7642-474-8/pbk; 978-88-7642-475-5/ebook). Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 16, 97-104 (2013).
MSC:  05C25 05C20 05C50
PDF BibTeX XML Cite
Full Text: arXiv

On perfect absorbants in de Bruijn digraphs. (English) Zbl 1303.05076

Fellows, Michael (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Third joint international conference, FAW-AAIM 2013, Dalian, China, June 26–28, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38755-5/pbk). Lecture Notes in Computer Science 7924, 303-314 (2013).
MSC:  05C20 68R10
PDF BibTeX XML Cite
Full Text: DOI

Stationary distribution and eigenvalues for a de Bruijn process. (English) Zbl 1271.05038

Kotsireas, Ilias S. (ed.) et al., Advances in combinatorics. In part based on the 3rd Waterloo workshop on computer algebra (WWCA, W80) 2011, Waterloo, Canada, May 26–29, 2011. Dedicated to Herbert Saul Wilf on the occasion of his 80th birthday. Berlin: Springer (ISBN 978-3-642-30978-6/hbk; 978-3-642-30979-3/ebook). 101-120 (2013).
MSC:  60J27 60C05 05C80
PDF BibTeX XML Cite
Full Text: DOI arXiv

Line directed hypergraphs. (English) Zbl 1285.05134

Naccache, David (ed.), Cryptography and security: From theory to applications. Essays dedicated to Jean-Jacques Quisquater on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-28367-3/pbk). Lecture Notes in Computer Science 6805, 25-34 (2012).
PDF BibTeX XML Cite
Full Text: DOI

Constructing orthogonal de Bruijn sequences. (English) Zbl 1342.68249

Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 595-606 (2011).
PDF BibTeX XML Cite
Full Text: DOI

An algebraic analogue of a formula of Knuth. (English. French summary) Zbl 1374.05115

Proceedings of the 22nd annual international conference on formal power series and algebraic combinatorics, FPSAC 2010, San Francisco, USA, August 2–6, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 379-390 (2010).
MSC:  05C25 05C50
PDF BibTeX XML Cite
Full Text: Link

Binary de Bruijn partial words with one hole. (English) Zbl 1284.68482

Kratochvíl, Jan (ed.) et al., Theory and applications of models of computation. 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7–11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13561-3/pbk). Lecture Notes in Computer Science 6108, 128-138 (2010).
MSC:  68R15
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software