Bioinformatics 2005 21(13):3062; doi:10.1093/bioinformatics/bti510
Published by Oxford University Press
Erratum
| A graph based algorithm for generating EST consensus sequences |
|---|
|
|
|---|
K. Malde, E. Coward and I. Jonassen
The authors wish to apologise for omitting references to and discussion of some additional related methods.
An alternative to using a de Bruijn word graph as we do, is to use a partial order alignment (POALee, 2003), a directed acyclic graph representing a (possibly multiple) alignment of sequences. Each node in the graph represents a set of positions, and edges connect nodes representing successive positions. While we derive the splice graph from the de Bruijn graph, Xing et al. (2004) use the predetermined multiple assembly represented in a POA as a starting point. They use a dynamic programming algorithm to identify possible splice variants from this graph.
| References |
|---|
|
|
|---|
Lee,C. (2003) Generating consensus sequences from partial order multiple sequence alignment graphs. Bioinformatics, 19, 9991008.
Xing,Y., Resch,A. and Lee,C. (2004) The multipassembly problem: reconstructing multiple transcript isoforms from EST fragment mixtures. Genome Res., 14, 426441.
![]()
CiteULike
Connotea
Del.icio.us What's this?
| ||||||||||||||||||||||||||||||||||||||||||||||||