Parallelising the Computation of Minimal Absent Words
Authors:
Open Access
- 2 April 2016
- book chapter
- Published by Springer Nature
- p. 243-253
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Linear-time computation of minimal absent words using suffix arrayBMC Bioinformatics, 2014
- Consequences of Faster Alignment of Sequences2014
- Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform2013
- Using minimal absent words to build phylogenyTheoretical Computer Science, 2012
- Minimal Absent Words in Four Human Genome AssembliesPLOS ONE, 2011
- Minimal Absent Words in Prokaryotic and Eukaryotic GenomesPLOS ONE, 2011
- Inducing the LCP-Array2011
- Nullomers: Really a Matter of Natural Selection?PLOS ONE, 2007
- Genome comparison without alignment using shortest unique substringsBMC Bioinformatics, 2005
- Automata and forbidden wordsInformation Processing Letters, 1998