The following pages link to Yuri Pirola (Q243835):
Displaying 14 items.
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- A study of the neutrality of Boolean function landscapes in genetic programming (Q418025) (← links)
- Divide and conquer computation of the multi-string BWT and LCP array (Q1670729) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning (Q2061990) (← links)
- Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
- An external-memory algorithm for string graph construction (Q2362353) (← links)
- On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem (Q2942249) (← links)
- Parameterized Complexity of k-Anonymity: Hardness and Tractability (Q3000512) (← links)
- Covering Pairs in Directed Acyclic Graphs (Q5404906) (← links)
- Beyond evolutionary trees (Q5962068) (← links)
- Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
