198 search results - page 9 / 40 » Efficient computation of absent words in genomic sequences |
101
click to vote
BMCBI
2004
14 years 9 months ago
2004
Background: Computer programs for the generation of multiple sequence alignments such as "Clustal W" allow detection of regions that are most conserved among many sequen...
BMCBI
2008
14 years 9 months ago
2008
Background: Detecting conserved noncoding sequences (CNSs) across species highlights the functional elements. Alignment procedures combined with computational prediction of transc...
124
click to vote
BMCBI
2011
14 years 4 months ago
2011
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...
BMCBI
2007
14 years 9 months ago
2007
Background: Biological sequence repeats arranged in tandem patterns are widespread in DNA and proteins. While many software tools have been designed to detect DNA tandem repeats (...
JCSS
2002
14 years 9 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...