المؤلفون: Leonardo Vanneschi, Tomassini, M., Pirola, Y., Verel, S., Collard, P., Mauri, G.

المساهمون: Vanneschi, L, Pirola, Y, Collard, P, Tomassini, M, Verel, S, Mauri, G, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Dipartimento di Informatica Sistemistica e Comunicazione (DISCo), Università degli Studi di Milano-Bicocca [Milano] (UNIMIB), Institut des systèmes d'information (ISI), Université de Lausanne (UNIL), M. Keijzer et al.

المصدر: Scopus-Elsevier
CIÊNCIAVITAE
GECCO
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Genetic And Evolutionary Computation Conference
Genetic And Evolutionary Computation Conference, Jul 2006, Seatle, United States. pp.895-902, ⟨10.1145/1143997.1144152⟩

مصطلحات موضوعية: Neutral network, Mathematical optimization, Fitness function, Fitness landscape, fitness landscapes, neutrality, INF/01 - INFORMATICA, Genetic programming, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Evolutionary computation, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], automatic programming, Tree structure, evolutionary computation, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Neutrality, Automatic programming, performance measure, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::485fe3492fedd464c0998c8d26f9034f
http://hdl.handle.net/10281/16492

المؤلفون: Bonizzoni, Paola, Della Vedova, Gianluca, Pirola, Yuri, Previtali, Marco, Rizzi, Raffaella

المساهمون: Bonizzoni, P, Della Vedova, G, Pirola, Y, Previtali, M, Rizzi, R

المصدر: UnpayWall
ORCID
Microsoft Academic Graph
Theoretical Computer Science

مصطلحات موضوعية: General Computer Science, Computer science, Generalization, String (computer science), Search engine indexing, LCP array, INF/01 - INFORMATICA, Data_CODINGANDINFORMATIONTHEORY, 0102 computer and information sciences, 02 engineering and technology, Parallel computing, 01 natural sciences, Theoretical Computer Science, External-memory algorithm, Set (abstract data type), 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, sort, 020201 artificial intelligence & image processing, Out-of-core algorithm, Burrows-Wheeler transform, Longest common prefix array, External-memory algorithm, Longest common prefix array, Burrows–Wheeler transform, Algorithm, Auxiliary memory

وصف الملف: STAMPA

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bab8b0f53f313c47c7558236e897d36
https://doi.org/10.1016/j.tcs.2020.11.041

المؤلفون: Marco Previtali, Raffaella Rizzi, Gianluca Della Vedova, Paola Bonizzoni, Yuri Pirola

المساهمون: Bonizzoni, P, Della Vedova, G, Pirola, Y, Previtali, M, Rizzi, R

المصدر: Algorithmica. 78:394-424

مصطلحات موضوعية: FOS: Computer and information sciences, 0301 basic medicine, General Computer Science, Burrows–Wheeler transform, Computer science, Open problem, 0102 computer and information sciences, 01 natural sciences, Set (abstract data type), 03 medical and health sciences, Computer Science - Data Structures and Algorithms, String graph, Quantitative Biology - Genomics, Data Structures and Algorithms (cs.DS), Auxiliary memory, Genomics (q-bio.GN), Applied Mathematics, INF/01 - INFORMATICA, Data structure, Quantitative Biology::Genomics, Computer Science Applications, 030104 developmental biology, 010201 computation theory & mathematics, FOS: Biological sciences, Theory of computation, Out-of-core algorithm, External memory algorithms, Burrows–Wheeler transform, String graphs, Genome assembly, Algorithm

وصف الملف: ELETTRONICO

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::643b0603a8b119052733e1f43c0fd24a
https://doi.org/10.1007/s00453-016-0165-4

المؤلفون: Paola Bonizzoni, Raffaella Rizzi, Yuri Pirola, Marco Previtali, Serena Nicosia, Gianluca Della Vedova

المساهمون: Bonizzoni, P, Della Vedova, G, Nicosia, S, Pirola, Y, Previtali, M, Rizzi, R

المصدر: Sailing Routes in the World of Computation ISBN: 9783319944173
CiE

مصطلحات موضوعية: 0301 basic medicine, Divide and conquer algorithms, Theoretical computer science, Computer science, Computation, String (computer science), Search engine indexing, LCP array, Data_CODINGANDINFORMATIONTHEORY, 0102 computer and information sciences, 01 natural sciences, BWT, External Memory Algorithms, 03 medical and health sciences, 030104 developmental biology, 010201 computation theory & mathematics, Out-of-core algorithm

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7319bc58227d08c4270d4e65f5118942
https://doi.org/10.1007/978-3-319-94418-0_11

المؤلفون: Raffaella Rizzi, Paola Bonizzoni, Marco Previtali, Yuri Pirola, Gianluca Della Vedova

المساهمون: Bonizzoni, P, DELLA VEDOVA, G, Pirola, Y, Previtali, M, Rizzi, R

مصطلحات موضوعية: 0301 basic medicine, Theoretical computer science, Burrows–Wheeler transform, Computer science, Pipeline (computing), 0102 computer and information sciences, external-memory algorithm, Burrows-Wheeler transform, 01 natural sciences, 03 medical and health sciences, Contig Mapping, Software, String graph, Genetics, Humans, Molecular Biology, Auxiliary memory, business.industry, Genome, Human, String (computer science), Search engine indexing, High-Throughput Nucleotide Sequencing, INF/01 - INFORMATICA, Sequence Analysis, DNA, string graph, Computational Mathematics, 030104 developmental biology, Computational Theory and Mathematics, 010201 computation theory & mathematics, Modeling and Simulation, Out-of-core algorithm, business

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2b0bb7aa569ba937575da6c88f9b98e
http://hdl.handle.net/10281/105592

المؤلفون: Riccardo Dondi, Paola Bonizzoni, Gunnar W. Klau, Simone Zaccaria, Nadia Pisanti, Yuri Pirola

المساهمون: Dipartimento di Informatica Sistemistica e Comunicazione (DISCo), Università degli Studi di Milano-Bicocca = University of Milano-Bicocca (UNIMIB), Dipartimento di Scienze dei Linguaggi, della Comunicazione e degli Studi Culturali, Università degli Studi di Bergamo = University of Bergamo (UniBg), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Life Sciences [Amsterdam] (MAC4), Centrum Wiskunde & Informatica (CWI), Dipartimento di Informatica [Pisa] (DI), University of Pisa - Università di Pisa, Econometrics and Operations Research, Bioinformatics, Integrative Bioinformatics, AIMMS, Bonizzoni, P, Dondi, R, Klau, G, Pirola, Y, Pisanti, N, Zaccaria, S, Università degli Studi di Milano-Bicocca [Milano] (UNIMIB), Università degli studi di Bergamo (UniBG)

المصدر: Journal of Computational Biology
Journal of Computational Biology, 2016, 23 (9), pp.718-736. ⟨10.1089/cmb.2015.0220⟩
Journal of Computational Biology, 23(9), 718-736. Mary Ann Liebert Inc.
Journal of Computational Biology, Mary Ann Liebert, 2016, 23 (9), pp.718-736. ⟨10.1089/cmb.2015.0220⟩
Journal of Computational Biology, 23(9), 718-736
Bonizzoni, P, Dondi, R, Klau, G W, Pirola, Y, Pisanti, N & Zaccaria, S 2016, ' On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes ', Journal of Computational Biology, vol. 23, no. 9, pp. 718-736 . https://doi.org/10.1089/cmb.2015.0220

مصطلحات موضوعية: 0301 basic medicine, haplotype, haplotypes, Computational complexity theory, graph theory, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Parameterized complexity, 0102 computer and information sciences, Biology, Polymorphism, Single Nucleotide, 01 natural sciences, Polyploidy, 03 medical and health sciences, Fragment (logic), Genetic, Computational Theory and Mathematic, Genetics, Humans, Cluster analysis, Molecular Biology, combinatorial optimization, graph theory, haplotypes, next-generation sequencing, Settore INF/01 - Informatica, Models, Genetic, Genome, Human, combinatorial optimization, next-generation sequencing, Modeling and Simulation, Computational Theory and Mathematics, Computational Mathematics, Computational mathematics, Graph theory, Sequence Analysis, DNA, Diploidy, 030104 developmental biology, 010201 computation theory & mathematics, Combinatorial optimization, Computational problem, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Algorithm, Algorithms

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85c73ba27738772fe5b8e7410e944e77
https://inria.hal.science/hal-01388448

المؤلفون: Yuri Pirola, Stefano Beretta, Riccardo Dondi, Paola Bonizzoni, Niko Beerenwinkel

المساهمون: Dediu, A-H, Martín-Vide, C, Sierra-Rodríguez, J-L, Truthe, B, Beerenwinkel, N, Beretta, S, Bonizzoni, P, Dondi, R, Pirola, Y

المصدر: Language and Automata Theory and Applications ISBN: 9783319049205
The Computer Journal, 58 (7)

مصطلحات موضوعية: FOS: Computer and information sciences, paired-end read, Minimum path cover, Sequence reconstruction, Paired-end reads, Computational complexity, Computational complexity theory, General Computer Science, constraint, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Combinatorics, Set (abstract data type), 03 medical and health sciences, Cardinality, Computer Science - Data Structures and Algorithms, path cover, Data Structures and Algorithms (cs.DS), oftware testing, Time complexity, Mathematics, 030304 developmental biology, 0303 health sciences, bioinformatic, Degree (graph theory), Settore INF/01 - Informatica, DAG, INF/01 - INFORMATICA, Path cover, sequence reconstruction, paired-end reads, computational complexity, Directed acyclic graph, Computer Science - Computational Complexity, 010201 computation theory & mathematics, Path (graph theory), MathematicsofComputing_DISCRETEMATHEMATICS

وصف الملف: application/application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82d813b79330893325b121751160ece5