Simultaneous identification of long similar substrings in large sets of sequences
<p>Abstract</p> <p>Background</p> <p>Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in order to identify genes and their alternative splice forms. Howev...
Main Authors: | Wittig Burghardt, Möller Friedrich, Kleffe Jürgen |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2007-05-01
|
Series: | BMC Bioinformatics |
Online Access: | http://www.biomedcentral.com/1471-2105/8/S5/S7 |
Similar Items
-
Genome comparison without alignment using shortest unique substrings
by: Möller Friedrich, et al.
Published: (2005-05-01) -
Fast algorithms for computing sequence distances by exhaustive substring composition
by: Apostolico Alberto, et al.
Published: (2008-10-01) -
Efficient privacy-preserving variable-length substring match for genome sequence
by: Yoshiki Nakagawa, et al.
Published: (2022-04-01) -
String Reconstruction from Substring Compositions
by: Acharya, Jayadev, et al.
Published: (2015) -
Computing Maximal Lyndon Substrings of a String
by: Frantisek Franek, et al.
Published: (2020-11-01)