Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Ahmad Retha"'
Publikováno v:
Ayad, L A K, Pissis, S P & Retha, A 2016, ' libFLASM: a software library for fixed-length approximate string matching ', BMC Bioinformatics, vol. 17, no. 1, 454 . https://doi.org/10.1186/s12859-016-1320-2
BMC Bioinformatics
BMC Bioinformatics
Background Approximate string matching is the problem of finding all factors of a given text that are at a distance at most k from a given pattern. Fixed-length approximate string matching is the problem of finding all factors of a text of length n t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08abd01a9bc04e16e1942b9d584b8b1c
https://doi.org/10.1186/s12859-016-1320-2
https://doi.org/10.1186/s12859-016-1320-2
Autor:
Ahmad Retha, Fatima Vayani, Roberto Grossi, Robert Mercaş, Nadia Pisanti, Solon P. Pissis, Costas S. Iliopoulos
Publikováno v:
Grossi, R, Iliopoulos, C S, Mercas, R, Pisanti, N, Pissis, S P, Retha, A & Vayani, F 2016, ' Erratum to: Circular sequence comparison : Algorithms and applications ', Algorithms for Molecular Biology, vol. 11, 21 . https://doi.org/10.1186/s13015-016-0084-6
Erratum to: Algorithms Mol Biol (2016) 11:12 DOI 10.1186/s13015-016-0076-6During the production process for this article [1], Theorem 1 in the ‘Algorithms’ section and Example 7 in the ‘Implementation’ section were formatted incorrectly. Thes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4629fd53c09513d2ce2f906e540ff10c
https://doi.org/10.1186/s13015-016-0084-6
https://doi.org/10.1186/s13015-016-0084-6
Autor:
Fatima Vayani, Robert Mercaş, Ahmad Retha, Costas S. Iliopoulos, Roberto Grossi, Nadia Pisanti, Solon P. Pissis
Publikováno v:
Grossi, R, Iliopoulos, C S, Mercas, R, Pisanti, N, Pissis, S P, Retha, A & Vayani, F 2016, ' Circular sequence comparison: algorithms and applications ', Algorithms for Molecular Biology, vol. 11, no. 1, pp. 1-14 . https://doi.org/10.1186/s13015-016-0076-6
Algorithms for Molecular Biology : AMB
Algorithms for Molecular Biology
Algorithms for Molecular Biology, 2016, 11 (1), pp.1-14. ⟨10.1186/s13015-016-0076-6⟩
Algorithms for Molecular Biology (11), 1-14. (2016)
Algorithms for Molecular Biology : AMB
Algorithms for Molecular Biology
Algorithms for Molecular Biology, 2016, 11 (1), pp.1-14. ⟨10.1186/s13015-016-0076-6⟩
Algorithms for Molecular Biology (11), 1-14. (2016)
Erratum to this article has been published in Algorithms for Molecular Biology 2016 DOI : 10.1186/s13015-016-0084-6 WOS : 000381712000001 PMID : 27471546; International audience; BackgroundSequence comparison is a fundamental step in many important t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f34a10634c8d3de7c30da07884c8fe84
https://doi.org/10.1186/s13015-016-0076-6
https://doi.org/10.1186/s13015-016-0076-6
Autor:
Ahmad Retha, Costas S. Iliopoulos, Fatima Vayani, Robert Mercaş, Roberto Grossi, Solon P. Pissis, Nadia Pisanti
Publikováno v:
15th International Workshop on Algorithms in Bioinformatics (WABI 2015)
15th International Workshop on Algorithms in Bioinformatics (WABI 2015), Sep 2015, Atlanta, United States. pp.203-216, ⟨10.1007/978-3-662-48221-6_15⟩
Lecture Notes in Computer Science ISBN: 9783662482209
WABI
15th International Workshop on Algorithms in Bioinformatics (WABI 2015), Sep 2015, Atlanta, United States. pp.203-216, ⟨10.1007/978-3-662-48221-6_15⟩
Lecture Notes in Computer Science ISBN: 9783662482209
WABI
International audience; Sequence comparison is a fundamental step in many important tasks in bioinformatics. Traditional algorithms for measuring approximation in sequence comparison are based on the notions of distance or similarity, and are general
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f400c71824c998630af3f0a9f63b066
https://inria.hal.science/hal-01246271v2/document
https://inria.hal.science/hal-01246271v2/document
Autor:
Ahmad Retha, Solon P. Pissis
Publikováno v:
IPDPS Workshops
Approximate string matching is the problem of finding all factors of a text t of length n with a distance at most k from a pattern x of length m ale; n. Fixed-length approximate string matching is the problem of finding all factors of a text t of len
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79706acb8679a08466acd9a739adcfe4
https://doi.org/10.1109/ipdpsw.2015.106
https://doi.org/10.1109/ipdpsw.2015.106
Publikováno v:
Experimental Algorithms ISBN: 9783319200859
SEA
SEA
Multiple sequence alignment is a core computational task in bioinformatics and has been extensively studied over the past decades. This computation requires an implicit assumption on the input data: the left- and right-most position for each sequence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68458780155f5dd3e61a89020d4ca9d0
https://doi.org/10.1007/978-3-319-20086-6_19
https://doi.org/10.1007/978-3-319-20086-6_19
Autor:
Julian Atienza-Herrero, Duncan Sneddon, Natalie Ring, Luis Santos, Tanja Fiegel, Ahmad Retha, Neil R. Horner, Ann-Marie Mallon, James M. Brown, Gagarine Yaikhom, Armida Di Fenza, Hugh P. Morgan, Steve D.M. Brown, Andrew Blake, Henrik Westerberg
Publikováno v:
Nature Methods. 12:698-699
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::679bd94cf6733d52c4952819e9304f24
https://doi.org/10.1038/nmeth.3477
https://doi.org/10.1038/nmeth.3477
Autor:
Paul Flicek, Mark Grifiths, Helen Parkinson, Duncan Sneddon, Chao-Kung Chen, Vivek Iyer, Peter Matthews, Steve D.M. Brown, Darren J. Oakley, Robert J. Wilson, William C. Skarnes, Armida Di Fenza, Jeremy Mason, Luis Santos, Tanja Fiegel, Gautier Koscielny, Ann-Marie Mallon, Andrew Blake, Hugh Morgan, Damian Smedley, Henrik Westerberg, Alan Horne, Asfand Qazi, Jonathan Warren, Ahmad Retha, Gagarine Yaikhom, Natalja Kurbatova, David Melvin, Richard Easty, Natasha A. Karp, Terrence F. Meehan, Julian Atienza-Herrero, Jack Regnart
Publikováno v:
Nucleic Acids Research
Europe PubMed Central
Europe PubMed Central
The International Mouse Phenotyping Consortium (IMPC) web portal (http://www.mousephenotype.org) provides the biomedical community with a unified point of access to mutant mice and rich collection of related emerging and existing mouse phenotype data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97783eb3ad311efb67c200202c93e332
https://pubmed.ncbi.nlm.nih.gov/24194600
https://pubmed.ncbi.nlm.nih.gov/24194600
Autor:
Henrik Westerberg, Hugh Morgan, Luis Santos, James M. Brown, Armida Di Fenza, Tanja Fiegel, Gagarine Yaikhom, Natalie Ring, Ahmad Retha, Ann-Marie Mallon, Neil R. Horner, Steve D.M. Brown, Julian Atienza-Herrero, Andrew Blake, Duncan Sneddon
Publikováno v:
Nature Methods. 12:1098-1098
Nat. Methods 12, 698–699 (2015); published online 30 July 2015; corrected after print 24 September 2015 In the version of this article initially published, a funding source was omitted. The authors acknowledge additional funding from the Medical Re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7836a2d11da9da4df17b2592b52aaa4
https://doi.org/10.1038/nmeth1115-1098c
https://doi.org/10.1038/nmeth1115-1098c