The following pages link to Paola Bonizzoni (Q243591):
Displaying 24 items.
- A tight lower bound for primitivity in k-structures (Q4632456) (← links)
- Circular splicing and regularity (Q4825394) (← links)
- Restricted and Swap Common Superstring: A Parameterized View (Q4899240) (← links)
- When and How the Perfect Phylogeny Model Explains Evolution (Q4979478) (← links)
- (Q5088919) (← links)
- Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages (Q5114209) (← links)
- Circular languages generated by complete splicing systems and pure unitary languages (Q5146649) (← links)
- Regular Splicing Languages Must Have a Constant (Q5199955) (← links)
- Fingerprint Clustering with Bounded Number of Missing Values (Q5307498) (← links)
- Covering Pairs in Directed Acyclic Graphs (Q5404906) (← links)
- Computational Science – ICCS 2005 (Q5709417) (← links)
- New Computational Paradigms (Q5717090) (← links)
- (Q5874431) (← links)
- Picture Languages Generated by Assembling Tiles (Q5894365) (← links)
- Algorithms and Computation (Q5897856) (← links)
- Picture Languages Generated by Assembling Tiles (Q5901513) (← links)
- The complexity of multiple sequence alignment with SP-score that is a metric (Q5941270) (← links)
- Nesting of prime substructures in \(k-\)ary relations (Q5941284) (← links)
- Fingerprint clustering with bounded number of missing values (Q5961971) (← links)
- On the regularity of circular splicing languages: a survey and new developments (Q5962067) (← links)
- Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
- From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth (Q6532347) (← links)
- Data structures for SMEM-finding in the PBWT (Q6545416) (← links)
- PANTAS DATA (Q6697970) (← links)
