All Stories

  1. FAMSA: Fast and accurate multiple sequence alignment of huge protein families
  2. Comment on: ‘ERGC: an efficient referential genome compression algorithm’
  3. Inter-population Differences in Retrogene Loss and Expression in Humans
  4. Indexing Arbitrary-Length k-Mers in Sequencing Reads
  5. GDC 2: Compression of large collections of genomes
  6. Correction: Indexes of Large Genome Collections on a PC
  7. CoMeta: Classification of Metagenomes Using k-mers
  8. KMC 2: fast and resource-frugal k-mer counting
  9. Disk-based compression of data from genome sequencing
  10. Efficient algorithms for the longest common subsequence in k-length substrings
  11. Indexes of Large Genome Collections on a PC
  12. DSRC 2--Industry-oriented compression of FASTQ files
  13. QuickProbs—A Fast Multiple Sequence Alignment Algorithm Designed for Graphics Processors
  14. Fast and Simple Circular Pattern Matching
  15. Subcubic Algorithms for the Sequence Excluded LCS Problem
  16. Bit-Parallel Algorithm for the Block Variant of the Merged Longest Common Subsequence Problem
  17. Kalign-LCS — A More Accurate and Faster Variant of Kalign2 Algorithm for the Multiple Sequence Alignment Problem
  18. An Improved Algorithm for Fast and Accurate Classification of Sequences
  19. An Effective Way of Storing and Accessing Very Large Transition Matrices Using Multi-core CPU and GPU Architectures
  20. BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM
  21. Genome compression: a novel approach for large collections
  22. Data compression for sequencing data
  23. Disk-based k-mer counting on a PC
  24. Quadratic-time algorithm for a string constrained LCS problem
  25. A PARALLEL ALGORITHM FOR THE CONSTRAINED MULTIPLE SEQUENCE ALIGNMENT PROBLEM DESIGNED FOR GPUs
  26. miRNEST database: an integrative approach in microRNA search and annotation
  27. Robust relative compression of genomes with random access
  28. Compression of DNA sequence reads in FASTQ format
  29. Efficient Representation of Transition Matrix in the Markov Process Modeling of Computer Networks
  30. A Parallel GPU-Designed Algorithm for the Constrained Multiple Sequence Alignment Problem
  31. Solving longest common subsequence and related problems on graphical processing units
  32. An algorithm for solving the longest increasing circular subsequence problem
  33. Computing the Longest Common Transposition-Invariant Subsequence with GPU
  34. On Two Variants of the Longest Increasing Subsequence Problem
  35. Speeding up transposition-invariant string matching
  36. Context exhumation after the Burrows–Wheeler transform
  37. Revisiting dictionary-based compression
  38. Second step algorithms in the Burrows-Wheeler compression algorithm
  39. How to squeeze a lexicon
  40. Improvements to Burrows-Wheeler compression algorithm