The following pages link to Paola Bonizzoni (Q243591):
Displayed 50 items.
- Item:Q243591 (redirect page) (← links)
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Anonymizing binary and small tables is hard to approximate (Q543515) (← links)
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← links)
- The binary perfect phylogeny with persistent characters (Q714807) (← links)
- A colored graph approach to perfect phylogeny with persistent characters (Q728267) (← links)
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words (Q782596) (← links)
- Incomplete directed perfect phylogeny in linear time (Q832858) (← links)
- Constants and label-equivalence: a decision procedure for reflexive regular splicing languages (Q847663) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- On automata on infinite trees (Q1186604) (← links)
- Primitive 2-structures with the \((n-2)\)-property (Q1334660) (← links)
- Separating some splicing models. (Q1603389) (← 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)
- The structure of reflexive regular splicing languages via Schützenberger constants (Q1779297) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- The haplotyping problem: an overview of computational models and solutions (Q1884294) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← 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)
- Existence of constants in regular splicing languages (Q2346417) (← links)
- An external-memory algorithm for string graph construction (Q2362353) (← links)
- Complexity insights of the minimum duplication problem (Q2440167) (← links)
- Regular splicing languages and subclasses (Q2484444) (← links)
- Linear splicing and syntactic monoid (Q2489941) (← links)
- On the power of circular splicing (Q2565850) (← links)
- Reconciling a gene tree to a species tree under the duplication cost model (Q2576867) (← links)
- A linear-time algorithm for the perfect phylogeny haplotype problem (Q2642317) (← links)
- (Q2723945) (← links)
- Complexity Insights of the Minimum Duplication Problem (Q2891364) (← 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)
- The k-Anonymity Problem Is Hard (Q3183594) (← links)
- Exemplar Longest Common Subsequence (Q3545118) (← links)
- A Decision Procedure for Reflexive Regular Splicing Languages (Q3617069) (← links)
- An Algorithm for the Modular Decomposition of Hypergraphs (Q4264487) (← links)
- (Q4273665) (← links)
- (Q4273666) (← links)
- (Q4412101) (← links)
- (Q4437502) (← links)
- (Q4452057) (← links)
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
- (Q4529979) (← links)
- Species-Driven Persistent Phylogeny (Q4601121) (← links)