HomologMiner: Looking for homologous genomic groups in whole genomes

Bioinformatics

Volumn 23, Issue 8, 2007, Pages 917-925

  Hou, Minmei ^a   Berman, Piotr ^a   Hsu, Chih Hao ^a   Harris, Robert S ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENE PRODUCT; GENOMIC DNA; OLFACTORY RECEPTOR PROTEIN; UNCLASSIFIED DRUG; ZINC FINGER PROTEIN;

ACCURACY; ARTICLE; COMPUTER PROGRAM; CONTROLLED STUDY; DNA SEQUENCE; GENE CLUSTER; GENETIC ALGORITHM; GENOME ANALYSIS; HUMAN; HUMAN GENOME; MACACA; MOUSE; NONHUMAN; PRIORITY JOURNAL; PROTEIN FAMILY; SEQUENCE HOMOLOGY; SPECIES DIFFERENCE; TANDEM REPEAT; ALGORITHM; CHROMOSOME MAP; GENETICS; METHODOLOGY; MOLECULAR GENETICS; NUCLEOTIDE REPEAT; NUCLEOTIDE SEQUENCE; SEQUENCE ALIGNMENT;

ALGORITHMS; BASE SEQUENCE; CHROMOSOME MAPPING; MOLECULAR SEQUENCE DATA; REPETITIVE SEQUENCES, NUCLEIC ACID; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SEQUENCE HOMOLOGY, NUCLEIC ACID; SOFTWARE;

EID: 34249664955     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btm048     Document Type: Article

References (21)

1. Altschul,S. et al. (1997) Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucleic Acids Res. 25, 3389-3402.
2. Bailey,J.A. et al. (2004) Analysis of segmental duplications and genome assembly in the mouse. Genome Res., 14, 789-801.
3. Bao,Z. and Eddy,S.R. (2002) Automated de novo identification of repeat sequence families in sequenced genomes. Genome Res., 12, 1269-1276.
4. Bejerano,G. et al. (2004) Into the heat of darkness: Large-scale clustering of human non-coding DNA. Bioinformatics, 20, i40-i48.
5. Blanchette,M. et al. (2004) Aligning multiple genomic sequences with the threaded blockset aligner. Genome Res., 14, 708-715.
6. Cameron,M. et al. (2006) Clustering near-identical sequences for fast homology search. LNBI, 3909, 175-189.
7. Campagna,D. et al. (2005) RAP: A new computer program for de novo identification of repeated sequences in whole genomes. Bioinformatics 21, 582-588.
8. Claverie,J.M. (2005) Fewer genes, more noncoding RNA. Science, 309, 1529-1530.
9. Cormen,T.H. et al. (2001) Introduction to Algorithms. 2nd edn. The MIT Press.
10. Edgar,R. and Myers,E.W. (2005) PILER: Identification and classification of genomic repeats. Bioinformatics, 21, i152-i158.
11. Enright,A.J. et al. (2002) An efficient algorithm for large-scale detection of protein families. Nucliec Acids Res., 30, 1575-1584.
12. Kawaji,H. et al. (2004) Graph-based clustering for finding distant relationships in a large set of protein sequences. Bioinformatics, 20, 243-252.
13. Kent,W.J. et al. (2002) The human genome browser at UCSC. Genome Res., 12, 996-1006.
14. Kim,S. and Lee,J. (2006) BAG: A graph theoretic sequence clustering algorithm. Int. J. Data Mining and Bioinformatics, 1, 178-200.
15. Olender,T. et al. (2004) The olfactory receptor universe - from whole genome analysis to structure and evolution, Genet. Mol. Res. 3, 545-553.
16. Park,J. et al. (2000) RSDB: Representative protein sequence databases have high information content. Bioinformatics, 16, 458-464.
17. Pevzner,P.A. et al. (2004) Do novo repeat classification and fragment assembly. Genome Res., 14, 1786-1796.
18. Price,A.L. et al. (2005) De novo identification of repeat families in large genomes. Bioinformatics, 21, i351-i358.
19. Schwartz,S. et al. (2004) Human-mouse alignments with BLASTZ. Genome Res., 13, 103-107.
20. Smit,AFA et al. (1996-2004) RepeatMasker Open-3.0, http://www.repeatmasker.org.
21. Stoer,M. and Wagner,F. (1994) A simple min cut algorithm. LNCS, 855, 141-147.