The following pages link to Jens Stoye (Q235723):
Displaying 30 items.
- Common intervals of multiple permutations (Q534763) (← links)
- Balanced vertices in trees and a simpler algorithm to compute the genomic distance (Q607155) (← links)
- Searching and inferring colorful topological motifs in vertex-colored graphs (Q782751) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- A new linear time algorithm to compute the genomic distance via the double cut and join distance (Q1038470) (← links)
- Algorithmic complexity of protein identification: Combinatorics of weighted strings (Q1422404) (← links)
- Dynamic alignment-free and reference-free read compression (Q1706503) (← links)
- A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates (Q1708439) (← links)
- Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
- Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning (Q2061990) (← links)
- New Genome Similarity Measures Based on Conserved Gene Adjacencies (Q2814599) (← links)
- (Q3024804) (← links)
- On the Similarity of Sets of Permutations and Its Applications to Genome Comparison (Q3082914) (← links)
- HP Distance Via Double Cut and Join Distance (Q3506942) (← links)
- Indexing and Searching a Mass Spectrometry Database (Q3558259) (← links)
- (Q4547751) (← links)
- Algorithms for Finding Gene Clusters (Q4801159) (← links)
- The Genesis of the DCJ Formula (Q4992755) (← links)
- The Potential of Family-Free Genome Comparison (Q4992763) (← links)
- Computing the Rearrangement Distance of Natural Genomes (Q5041791) (← links)
- Finding all maximal perfect haplotype blocks in linear time (Q5091735) (← links)
- Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings (Q5110883) (← links)
- Bloom Filter Trie – A Data Structure for Pan-Genome Storage (Q5283830) (← links)
- Combinatorial Pattern Matching (Q5315346) (← links)
- (Q5471628) (← links)
- Research in Computational Molecular Biology (Q5706860) (← links)
- Research in Computational Molecular Biology (Q5706911) (← links)
- Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)
- A linear time algorithm for an extended version of the breakpoint double distance (Q6587074) (← links)
- Closing the complexity gap of the double distance problem (Q6751796) (← links)
