Finding Nested Common Intervals Efficiently

Blin G, Faye D, Stoye J (2010)
Journal of Computational Biology 17(9): 1183-1194.

Journal Article | Published | English

No fulltext has been uploaded

Author
; ;
Publishing Year
ISSN
eISSN
PUB-ID

Cite this

Blin G, Faye D, Stoye J. Finding Nested Common Intervals Efficiently. Journal of Computational Biology. 2010;17(9):1183-1194.
Blin, G., Faye, D., & Stoye, J. (2010). Finding Nested Common Intervals Efficiently. Journal of Computational Biology, 17(9), 1183-1194.
Blin, G., Faye, D., and Stoye, J. (2010). Finding Nested Common Intervals Efficiently. Journal of Computational Biology 17, 1183-1194.
Blin, G., Faye, D., & Stoye, J., 2010. Finding Nested Common Intervals Efficiently. Journal of Computational Biology, 17(9), p 1183-1194.
G. Blin, D. Faye, and J. Stoye, “Finding Nested Common Intervals Efficiently”, Journal of Computational Biology, vol. 17, 2010, pp. 1183-1194.
Blin, G., Faye, D., Stoye, J.: Finding Nested Common Intervals Efficiently. Journal of Computational Biology. 17, 1183-1194 (2010).
Blin, Guillaume, Faye, David, and Stoye, Jens. “Finding Nested Common Intervals Efficiently”. Journal of Computational Biology 17.9 (2010): 1183-1194.
This data publication is cited in the following publications:
This publication cites the following data publications:

4 Citations in Europe PMC

Data provided by 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

13 References

Data provided by Europe PubMed Central.

Fast Algorithms to Enumerate All Common Intervals of Two Permutations
Uno, Algorithmica 26(2), 2000
Identifying conserved gene clusters in the presence of homology families.
He X, Goldwasser MH., J. Comput. Biol. 12(6), 2005
PMID: 16108708
The Incompatible Desiderata of Gene Cluster Properties
Hoberman, 2005
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Booth, Journal of Computer and System Sciences 13(3), 1976
The Algorithmic of Gene Teams
Bergeron, 2002
Computing Common Intervals of $K$ Permutations, with Applications to Modular Decomposition of Graphs
Bergeron, SIAM Journal on Discrete Mathematics 22(3), 2008
Gene proximity analysis across whole genomes via PQ trees.
Landau GM, Parida L, Weimann O., J. Comput. Biol. 12(10), 2005
PMID: 16379535
Character sets of strings
DIDIER, Journal of Discrete Algorithms 5(2), 2007
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
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
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
Schmidt, 2004

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Sources

PMID: 20874403
PubMed | Europe PMC

Search this title in

Google Scholar