The following pages link to Tomáš Vinař (Q392205):
Displaying 15 items.
- Efficient routing in carrier-based mobile networks (Q392206) (← links)
- Palindrome recognition using a multidimensional tape. (Q1401342) (← links)
- Isometric gene tree reconciliation revisited (Q1708413) (← links)
- Vector seeds: An extension to spaced seeds (Q1775772) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Probabilistic models of \(k\)-mer frequencies (extended abstract) (Q2117786) (← links)
- Sequence annotation with HMMs: new problems and their complexity (Q2345874) (← links)
- The most probable annotation problem in HMMs and its application to bioinformatics (Q2643730) (← links)
- Fast computation of a string duplication history under no-breakpoint-reuse (Q2955628) (← links)
- Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions (Q3550826) (← links)
- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection (Q3575245) (← links)
- (Q4536355) (← links)
- (Q4737700) (← links)
- New Bounds for Motif Finding in Strong Instances (Q5307497) (← links)
- Combinatorial Pattern Matching (Q5713531) (← links)