New Error Tolerant Method for Search of Long Repeats in DNA Sequences
- 12 June 2016
- book chapter
- Published by Springer Nature
- p. 171-182
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- A Complete and Accurate Ab Initio Repeat Finding AlgorithmInterdisciplinary Sciences: Computational Life Sciences, 2015
- Red: an intelligent, rapid, accurate tool for detecting repeats de-novo on the genomic scaleBMC Bioinformatics, 2015
- Distributed and Sequential Algorithms for Bioinformatics2015
- PRAP: an ab initio software package for automated genome-wide analysis of DNA repeats for prokaryotesBioinformatics, 2013
- RepeatExplorer: a Galaxy-based web server for genome-wide characterization of eukaryotic repetitive elements from next-generation sequence readsBioinformatics, 2013
- A survey of longest common subsequence algorithms2002
- Basic local alignment search toolJournal of Molecular Biology, 1990
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975