Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Enrico Siragusa"'
Autor:
Filippo Utro, Niina Haiminen, Enrico Siragusa, Laura-Jayne Gardiner, Ed Seabolt, Ritesh Krishna, James H. Kaufman, Laxmi Parida
Publikováno v:
iScience, Vol 23, Iss 4, Pp - (2020)
Summary: Increasingly available microbial reference data allow interpreting the composition and function of previously uncharacterized microbial communities in detail, via high-throughput sequencing analysis. However, efficient methods for read class
Externí odkaz:
https://doaj.org/article/3dbecda796664f1e947437d45d3d1f3e
Publikováno v:
IEEE/ACM Transactions on Computational Biology and Bioinformatics. 16:1132-1142
Computer simulations can be used to study population genetic methods, models, and parameters, as well as to predict potential outcomes. For example, in plant populations, predicting the outcome of breeding operations can be studied using simulations.
Autor:
Melissa A. Haendel, Tomasz Zemojtel, William P. Bone, Enrico Siragusa, Nicole L. Washington, Peter N. Robinson, Damian Smedley, Manuel Holtgrewe, Marten Jäger, Orion J. Buske, Julius O.B. Jacobsen, Sebastian Köhler, Max Schubach
Publikováno v:
Nature Protocols. 10:2004-2015
Exomiser is an application that prioritizes genes and variants in next-generation sequencing (NGS) projects for novel disease-gene discovery or differential diagnostics of Mendelian disease. Exomiser comprises a suite of algorithms for prioritizing e
Publikováno v:
Bioinformatics (Oxford, England) 35 (2019) 18
Bioinformatics
Bioinformatics (Oxford, England), 35(18), 3279-3286
Bioinformatics
Bioinformatics (Oxford, England), 35(18), 3279-3286
Summary Haplotype assembly of polyploids is an open issue in plant genomics. Recent experimental studies on highly heterozygous autotetraploid potato have shown that available methods do not deliver satisfying results in practice. We propose an optim
Autor:
Enrico Siragusa, Enrico Seiler, Knut Reinert, Bernhard Y. Renard, Temesgen Hailemariam Dadi, Andreas Andrusch, Vitor C. Piro
MotivationMapping-based approaches have become limited in their application to very large sets of references since computing an FM-index for very large databases (e.g. > 10 GB) has become a bottleneck. This affects many analyses that need such index
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc969a71f7b97c72c288a15e2af8ca9a
Autor:
Marcel Ehrhardt, David Weese, Jongkyu Kim, Gianvito Urgese, Svenja Mehringer, Knut Reinert, Jörg Winkler, Temesgen Hailemariam Dadi, Christopher Pockrandt, Enrico Siragusa, Hannes Hauswedell, René Rahn
Publikováno v:
Journal of biotechnology. 261
Background The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome ( Venter et al., 2001 ) would not have been possible without advanced assembly algorithms and the
Autor:
Enrico Siragusa, David Weese
Publikováno v:
Algorithms for Next-Generation Sequencing Data ISBN: 9783319598246
Algorithms for Next-Generation Sequencing Data
Algorithms for Next-Generation Sequencing Data
Recent advances in High-Throughput Sequencing demand for novel algorithms working on efficient data structures specifically designed for the analysis of large volumes of sequence data. This chapter describes such data structures, called full-text ind
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7072efb2de79b25d51bece6ea116d487
https://doi.org/10.1007/978-3-319-59826-0_2
https://doi.org/10.1007/978-3-319-59826-0_2
Autor:
Dong Deng, Shashwat Mishra, Sebastian Wandelt, Petar Mitankin, Enrico Siragusa, Ulf Leser, Stefan Gerdjikov, Manish Patil, Wei Wang, Jiaying Wang, Alexander Tiskin
String similarity search and its variants are fundamental problems with many applications in areas such as data integration, data quality, computational linguistics, or bioinformatics. A plethora of methods have been developed over the last decades.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::013beefed87b929b4a9db03478e143ce
http://wrap.warwick.ac.uk/65568/1/WRAP_Tiskin_p64-wandelt.pdf
http://wrap.warwick.ac.uk/65568/1/WRAP_Tiskin_p64-wandelt.pdf
Publikováno v:
EDBT/ICDT Workshops
We present in this paper scalable algorithms for optimal string similarity search and join. Our methods are variations of those applied in Masai [15], our recently published tool for mapping high-throughput DNA sequencing data with unpreceded speed a
Publikováno v:
Algorithms for Molecular Biology, Vol 2, Iss 1, p 10 (2007)
Algorithms for molecular biology : AMB
Algorithms for molecular biology : AMB
This paper presents a software library, nicknamed BATS, for some basic sequence analysis tasks. Namely, local alignments, via approximate string matching, and global alignments, via longest common subsequence and alignments with affine and concave ga
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84ed3d2d4cb55a719b49fff272ce52ac
http://hdl.handle.net/10447/37495
http://hdl.handle.net/10447/37495