2004
DOI: 10.1093/bioinformatics/bti168
|View full text |Cite
|
Sign up to set email alerts
|

Statistical detection of chromosomal homology using shared-gene density alone

Abstract: pfbaldi@ics.uci.edu.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0

Year Published

2004
2004
2010
2010

Publication Types

Select...
2
2
2

Relationship

0
6

Authors

Journals

citations
Cited by 30 publications
(31 citation statements)
references
References 19 publications
0
31
0
Order By: Relevance
“…Continuous stretches of duplicate genes can be computationally deduced through synteny, using some variants of clustering approaches (Vandepoele et al 2002;Hampson et al 2005) or more specifically using dynamic programming with a customized scoring scheme if conserved gene order (collinearity) is also considered (Haas et al 2004;Wang et al 2006). Traditional methods for deduction of synteny based on "best-in-genome" criteria (Miller et al 2007), uncovering one-to-one best matching regions during pairwise genome comparisons, are relatively straightforward in vertebrates yet difficult in angiosperms because of additional challenges that are more prominent in angiosperm genomes (Tang et al 2008).…”
mentioning
confidence: 99%
“…Continuous stretches of duplicate genes can be computationally deduced through synteny, using some variants of clustering approaches (Vandepoele et al 2002;Hampson et al 2005) or more specifically using dynamic programming with a customized scoring scheme if conserved gene order (collinearity) is also considered (Haas et al 2004;Wang et al 2006). Traditional methods for deduction of synteny based on "best-in-genome" criteria (Miller et al 2007), uncovering one-to-one best matching regions during pairwise genome comparisons, are relatively straightforward in vertebrates yet difficult in angiosperms because of additional challenges that are more prominent in angiosperm genomes (Tang et al 2008).…”
mentioning
confidence: 99%
“…Such implicit constraints may be particularly problematic when the goal is to characterize the properties of homologous regions. For example, although the CloseUp algorithm was ostensibly designed to identify chromosomal homology using "shared-gene density alone" [33], the greedy nature of the search algorithm means that all clusters with a minimum gene density may not actually be detected. If such an approach was used to evaluate the extent to which order is conserved in homologous regions, incorrect inferences could be made.…”
Section: Discussionmentioning
confidence: 99%
“…Clusters have also been defined in terms of graph-theoretic structures (e.g., Figure 1(c)), such as connected components [27] or high-scoring paths [28,29]. Finally, a variety of heuristics have been proposed to search for gene clusters [30,25,31,32,33,34,29,11], the majority of which are specifically de-signed to find sets of genes in approximately collinear order (i.e., forming a rough diagonal on the dot-plot).…”
Section: Cluster Definitionsmentioning
confidence: 99%
See 2 more Smart Citations