×

Found 257 Documents (Results 1–100)

On the effect of intralocus recombination on triplet-based species tree estimation. (English) Zbl 1496.92059

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, 143-158 (2022).
MSC:  92D15
PDFBibTeX XMLCite
Full Text: DOI

Parsimonious clone tree reconciliation in cancer. (English) Zbl 1519.92172

Carbone, Alessandra (ed.) et al., 21st international workshop on algorithms in bioinformatics, WABI 2021, August 2–4, 2021, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 201, Article 9, 21 p. (2021).
PDFBibTeX XMLCite
Full Text: DOI

Treewidth-based algorithms for the small parsimony problem on networks. (English) Zbl 1519.92150

Carbone, Alessandra (ed.) et al., 21st international workshop on algorithms in bioinformatics, WABI 2021, August 2–4, 2021, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 201, Article 6, 21 p. (2021).
MSC:  92D15 90C39 92-08
PDFBibTeX XMLCite
Full Text: DOI

The most parsimonious reconciliation problem in the presence of incomplete lineage sorting and hybridization is NP-hard. (English) Zbl 1519.92144

Carbone, Alessandra (ed.) et al., 21st international workshop on algorithms in bioinformatics, WABI 2021, August 2–4, 2021, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 201, Article 1, 10 p. (2021).
MSC:  92D15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

TreeSolve: rapid error-correction of microbial gene trees. (English) Zbl 1500.92067

Martín-Vide, Carlos (ed.) et al., Algorithms for computational biology. 7th international conference, AlCoB 2020, Missoula, MT, USA, April 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12099, 125-139 (2020).
MSC:  92D15 93C70 92-08
PDFBibTeX XMLCite
Full Text: DOI

Linear time algorithm for tree-child network containment. (English) Zbl 1500.92066

Martín-Vide, Carlos (ed.) et al., Algorithms for computational biology. 7th international conference, AlCoB 2020, Missoula, MT, USA, April 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12099, 93-107 (2020).
MSC:  92D15 92C42
PDFBibTeX XMLCite
Full Text: DOI

Phylogenetic networks. (English) Zbl 1448.92155

Harris, Pamela E. (ed.) et al., A project-based guide to undergraduate research in mathematics. Starting and sustaining accessible undergraduate research. Cham: Birkhäuser. Found. Undergrad. Res. Math., 29-61 (2020).
MSC:  92D15 92C42 05C90
PDFBibTeX XMLCite
Full Text: DOI arXiv

Consensus clusters in Robinson-Foulds reticulation networks. (English) Zbl 1495.92047

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 12, 12 p. (2019).
MSC:  92D15 68R10 92-08
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parsimonious migration history problem: complexity and algorithms. (English) Zbl 1494.92076

Parida, Laxmi (ed.) et al., 18th international workshop on algorithms in bioinformatics, WABI 2018, Helsinki, Finland, August 20–22, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 113, Article 24, 14 p. (2018).
MSC:  92D15 92-08
PDFBibTeX XMLCite
Full Text: DOI

Reconciling multiple genes trees via segmental duplications and losses. (English) Zbl 1494.92064

Parida, Laxmi (ed.) et al., 18th international workshop on algorithms in bioinformatics, WABI 2018, Helsinki, Finland, August 20–22, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 113, Article 5, 16 p. (2018).
MSC:  92D10 92D15 92-08
PDFBibTeX XMLCite
Full Text: DOI arXiv

Tree containment with soft polytomies. (English) Zbl 1477.68199

Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 9, 14 p. (2018).
MSC:  68R10 68Q17 92D15
PDFBibTeX XMLCite
Full Text: DOI

Reconciliation feasibility of non-binary gene trees under a duplication-loss-coalescence model. (English) Zbl 1392.92058

Jansson, Jesper (ed.) et al., Algorithms for computational biology. 5th international conference, ALCoB 2018, Hong Kong, China, June 25–26, 2018. Proceedings. Cham: Springer (ISBN 978-3-319-91937-9/pbk; 978-3-319-91938-6/ebook). Lecture Notes in Computer Science 10849. Lecture Notes in Bioinformatics, 11-23 (2018).
MSC:  92D15
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

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