<p>(A) Example of a read alignment graph based on the insert size criterion. Alignments of read pairs are shown in gray and the corresponding nodes in the graph representation are depicted in blue. The four bottom-most alignment pairs stem from a haplotype harboring a deletion (shown in orange in the reference genome) and therefore display a larger insert size than the remaining alignment pairs. Note that the four deletion-indicating alignment pairs form a max-clique (circled in orange). (B) Illustration of the compatible gaps condition of the sequence similarity criterion. Two reads and are aligned against the reference (left). This induces a direct read-to-read alignment of and (right). Case (1): No gaps in the reference alignments le...
Background: The maximum clique enumeration (MCE) problem asks that we identify all maximum cliques i...
We study the problem of similarity detection by sequence alignment with gaps, using a recently estab...
Recently, the problem of extending an alignment with k-mismatches and a single gap for pairwise sequ...
Motivation: Next-generation sequencing techniques have facilitated a large-scale analysis of human g...
Next-generation sequencing techniques have for the first time facilitated a large scale analysis of ...
Motivation: Next-generation sequencing techniques have facilitated large scale analysis of human gen...
Next-generation sequencing techniques have facilitated a large scale analysis of human genetic varia...
Abstract. For a genomic region containing a tandem gene cluster, a proper set of alignments needs to...
Abstract Background The presence of gaps in an alignment of nucleotide or protein sequences is often...
AbstractWe discuss three problems, which we call blocking, chaining and flattening, that arise when ...
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a max...
<p>A sequence read is divided into three fragments, <i>A</i>, <i>B</i>, and <i>C</i> (see <a href="h...
<p><b>Copyright information:</b></p><p>Taken from "Simultaneous identification of long similar subst...
<p>(a) The resolution of gap 00237-G-00238. (b) The resolution of gap 00240-G-00241. (c) The sequenc...
<p><b>Copyright information:</b></p><p>Taken from "A haplome alignment and reference sequence of the...
Background: The maximum clique enumeration (MCE) problem asks that we identify all maximum cliques i...
We study the problem of similarity detection by sequence alignment with gaps, using a recently estab...
Recently, the problem of extending an alignment with k-mismatches and a single gap for pairwise sequ...
Motivation: Next-generation sequencing techniques have facilitated a large-scale analysis of human g...
Next-generation sequencing techniques have for the first time facilitated a large scale analysis of ...
Motivation: Next-generation sequencing techniques have facilitated large scale analysis of human gen...
Next-generation sequencing techniques have facilitated a large scale analysis of human genetic varia...
Abstract. For a genomic region containing a tandem gene cluster, a proper set of alignments needs to...
Abstract Background The presence of gaps in an alignment of nucleotide or protein sequences is often...
AbstractWe discuss three problems, which we call blocking, chaining and flattening, that arise when ...
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a max...
<p>A sequence read is divided into three fragments, <i>A</i>, <i>B</i>, and <i>C</i> (see <a href="h...
<p><b>Copyright information:</b></p><p>Taken from "Simultaneous identification of long similar subst...
<p>(a) The resolution of gap 00237-G-00238. (b) The resolution of gap 00240-G-00241. (c) The sequenc...
<p><b>Copyright information:</b></p><p>Taken from "A haplome alignment and reference sequence of the...
Background: The maximum clique enumeration (MCE) problem asks that we identify all maximum cliques i...
We study the problem of similarity detection by sequence alignment with gaps, using a recently estab...
Recently, the problem of extending an alignment with k-mismatches and a single gap for pairwise sequ...