Finding Nested Common Intervals Efficiently

Blin G, Stoye J (2009)
In: Proc. of Recomb-CG 2009. LNBI, 5817. 59-69.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Konferenzbeitrag | Veröffentlicht | Englisch
Autor
;
Erscheinungsjahr
Titel des Konferenzbandes
Proc. of Recomb-CG 2009
Band
5817
Seite
59-69
Konferenz
Recomb-CG 2009
ISSN
PUB-ID

Zitieren

Blin G, Stoye J. Finding Nested Common Intervals Efficiently. In: Proc. of Recomb-CG 2009. LNBI. Vol 5817. 2009: 59-69.
Blin, G., & Stoye, J. (2009). Finding Nested Common Intervals Efficiently. Proc. of Recomb-CG 2009, 5817, 59-69. doi:10.1007/978-3-642-04744-2_6
Blin, G., and Stoye, J. (2009). “Finding Nested Common Intervals Efficiently” in Proc. of Recomb-CG 2009 LNBI, vol. 5817, 59-69.
Blin, G., & Stoye, J., 2009. Finding Nested Common Intervals Efficiently. In Proc. of Recomb-CG 2009. LNBI. no.5817 pp. 59-69.
G. Blin and J. Stoye, “Finding Nested Common Intervals Efficiently”, Proc. of Recomb-CG 2009, LNBI, vol. 5817, 2009, pp.59-69.
Blin, G., Stoye, J.: Finding Nested Common Intervals Efficiently. Proc. of Recomb-CG 2009. LNBI. 5817, p. 59-69. (2009).
Blin, Guillaume, and Stoye, Jens. “Finding Nested Common Intervals Efficiently”. Proc. of Recomb-CG 2009. 2009.Vol. 5817. LNBI. 59-69.

5 Zitationen in Europe PMC

Daten bereitgestellt von Europe PubMed Central.

Constructing a Gene Team Tree in Almost O (n lg n) Time.
Wang BF, Lin CH, Yang IT., IEEE/ACM Trans Comput Biol Bioinform 11(1), 2014
PMID: 26355514
Easy identification of generalized common and conserved nested intervals.
de Montgolfier F, Raffinot M, Rusu I., J Comput Biol 21(7), 2014
PMID: 24650221
A new efficient algorithm for the gene-team problem on general sequences.
Wang BF, Kuo CC, Liu SJ, Lin CH., IEEE/ACM Trans Comput Biol Bioinform 9(2), 2012
PMID: 22282907
Consistency of sequence-based gene clusters.
Wittler R, Maňuch J, Patterson M, Stoye J., J Comput Biol 18(9), 2011
PMID: 21899413

18 References

Daten bereitgestellt von Europe PubMed Central.


AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
Comparing genomes with duplications: a computational complexity point of view.
Blin G, Chauve C, Fertin G, Rizzi R, Vialette S., IEEE/ACM Trans Comput Biol Bioinform 4(4), 2007
PMID: 17975264
Computation of median gene clusters.
Bocker S, Jahn K, Mixtacki J, Stoye J., J. Comput. Biol. 16(8), 2009
PMID: 19689215

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
Identifying conserved gene clusters in the presence of homology families.
He X, Goldwasser MH., J. Comput. Biol. 12(6), 2005
PMID: 16108708

AUTHOR UNKNOWN, 0
Gene proximity analysis across whole genomes via PQ trees.
Landau GM, Parida L, Weimann O., J. Comput. Biol. 12(10), 2005
PMID: 16379535

AUTHOR UNKNOWN, 0

Rahmann, Lect. Notes Bioinform. 4175(), 2006

AUTHOR UNKNOWN, 0

AUTHOR UNKNOWN, 0
Gene team tree: a hierarchical representation of gene teams for all gap lengths.
Zhang M, Leong HW., J. Comput. Biol. 16(10), 2009
PMID: 19803736

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®

Quellen

PMID: 20874403
PubMed | Europe PMC

Suchen in

Google Scholar