154 results on '"Veli Mäkinen"'
Search Results
2. Chaining of Maximal Exact Matches in Graphs.
3. Finding Maximal Exact Matches in Graphs.
4. On the Complexity of String Matching for Graphs.
5. Algorithms and Complexity on Indexing Founder Graphs.
6. Finding maximal exact matches in graphs.
7. Elastic founder graphs improved and enhanced.
8. Indexable Elastic Founder Graphs of Minimum Height.
9. Linear Time Construction of Indexable Elastic Founder Graphs.
10. Finding Maximal Exact Matches in Graphs.
11. Elastic Founder Graphs Improved and Enhanced.
12. Chaining of Maximal Exact Matches in Graphs.
13. Chaining for accurate alignment of erroneous long reads to acyclic variation graphs.
14. Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails.
15. Algorithms and Complexity on Indexing Elastic Founder Graphs.
16. Chaining with Overlaps Revisited.
17. Scalable Reference Genome Assembly from Compressed Pan-Genome Index with Spark.
18. Tailoring r-index for Document Listing Towards Metagenomics Applications.
19. Linear Time Construction of Indexable Founder Block Graphs.
20. Accurate spliced alignment of long RNA sequencing reads.
21. Founder reconstruction enables scalable and seamless pangenomic analysis.
22. On the Complexity of String Matching for Graphs.
23. Linear Time Maximum Segmentation Problems in Column Stream Model.
24. Linear-time String Indexing and Analysis in Small Space.
25. Linear Time Construction of Indexable Elastic Founder Graphs.
26. Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails.
27. Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended.
28. Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time.
29. Sparse Dynamic Programming on DAGs with Small Width.
30. MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP.
31. Bit-parallel sequence-to-graph alignment.
32. Linear time minimum segmentation enables scalable founder reconstruction.
33. Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics.
34. Algorithms and Complexity on Indexing Founder Graphs.
35. Conditional Indexing Lower Bounds Through Self-Reducibility.
36. Tailoring r-index for metagenomics.
37. Linear Time Construction of Indexable Founder Block Graphs.
38. Chaining with overlaps revisited.
39. A safe and complete algorithm for metagenomic assembly.
40. Bidirectional Variable-Order de Bruijn Graphs.
41. Evaluating approaches to find exon chains based on long reads.
42. Applying the Positional Burrows-Wheeler Transform to all-pairs Hamming distance.
43. On using Longer RNA-seq Reads to Improve Transcript Prediction Accuracy.
44. Fully Dynamic de Bruijn Graphs.
45. Bidirectional Variable-Order de Bruijn Graphs.
46. MetaFlow: Metagenomic Profiling Based on Whole-Genome Coverage Analysis with Min-Cost Flows.
47. Identification of Variant Compositions in Related Strains Without Reference.
48. Interval scheduling maximizing minimum coverage.
49. A framework for space-efficient read clustering in metagenomic samples.
50. On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.