The following pages link to Guillaume Blin (Q413296):
Displayed 27 items.
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- Complexity insights of the minimum duplication problem (Q2440167) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- SOBRA - Shielding Optimization for BRAchytherapy (Q2819514) (← links)
- MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS (Q2841985) (← links)
- Complexity Insights of the Minimum Duplication Problem (Q2891364) (← links)
- An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval (Q2898043) (← links)
- Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths (Q2904487) (← links)
- (Q2915603) (← links)
- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem (Q2946037) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions (Q3404437) (← links)
- How to Compare Arc-Annotated Sequences: The Alignment Hierarchy (Q3523001) (← links)
- A Faster Algorithm for Finding Minimum Tucker Submatrices (Q3576192) (← links)
- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated (Q3605511) (← links)
- Extending the Hardness of RNA Secondary Structure Comparison (Q3611904) (← links)
- On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
- (Q5140768) (← links)
- Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem (Q5175111) (← links)
- Algorithmic Aspects of Heterogeneous Biological Networks Comparison (Q5199156) (← links)
- Combinatorial Pattern Matching (Q5315340) (← links)
- What Makes the Arc-Preserving Subsequence Problem Hard? (Q5449952) (← links)
- Computational Science – ICCS 2005 (Q5709406) (← links)
- Computing and Combinatorics (Q5716968) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897562) (← links)