ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Publication Date: 2002-08-10
    Description: Primate-specific segmental duplications are considered important in human disease and evolution. The inability to distinguish between allelic and duplication sequence overlap has hampered their characterization as well as assembly and annotation of our genome. We developed a method whereby each public sequence is analyzed at the clone level for overrepresentation within a whole-genome shotgun sequence. This test has the ability to detect duplications larger than 15 kilobases irrespective of copy number, location, or high sequence similarity. We mapped 169 large regions flanked by highly similar duplications. Twenty-four of these hot spots of genomic instability have been associated with genetic disease. Our analysis indicates a highly nonrandom chromosomal and genic distribution of recent segmental duplications, with a likely role in expanding protein diversity.〈br /〉〈span class="detail_caption"〉Notes: 〈/span〉Bailey, Jeffrey A -- Gu, Zhiping -- Clark, Royden A -- Reinert, Knut -- Samonte, Rhea V -- Schwartz, Stuart -- Adams, Mark D -- Myers, Eugene W -- Li, Peter W -- Eichler, Evan E -- CA094816/CA/NCI NIH HHS/ -- GM58815/GM/NIGMS NIH HHS/ -- HG002318/HG/NHGRI NIH HHS/ -- New York, N.Y. -- Science. 2002 Aug 9;297(5583):1003-7.〈br /〉〈span class="detail_caption"〉Author address: 〈/span〉Department of Genetics, Center for Computational Genomics, and Center for Human Genetics, Case Western Reserve University School of Medicine and University Hospitals of Cleveland, Cleveland, OH 44106, USA.〈br /〉〈span class="detail_caption"〉Record origin:〈/span〉 〈a href="http://www.ncbi.nlm.nih.gov/pubmed/12169732" target="_blank"〉PubMed〈/a〉
    Keywords: Alleles ; Base Sequence ; Biological Evolution ; Chromosomes, Human/genetics ; Computational Biology ; Databases, Nucleic Acid ; Exons ; Expressed Sequence Tags ; *Gene Duplication ; Gene Rearrangement ; *Genes, Duplicate ; Genetic Diseases, Inborn/genetics ; *Genome, Human ; Humans ; Models, Genetic ; Polymorphism, Single Nucleotide ; Proteome ; Recombination, Genetic ; Sequence Alignment
    Print ISSN: 0036-8075
    Electronic ISSN: 1095-9203
    Topics: Biology , Chemistry and Pharmacology , Computer Science , Medicine , Natural Sciences in General , Physics
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2002-10-05
    Description: Anopheles gambiae is the principal vector of malaria, a disease that afflicts more than 500 million people and causes more than 1 million deaths each year. Tenfold shotgun sequence coverage was obtained from the PEST strain of A. gambiae and assembled into scaffolds that span 278 million base pairs. A total of 91% of the genome was organized in 303 scaffolds; the largest scaffold was 23.1 million base pairs. There was substantial genetic variation within this strain, and the apparent existence of two haplotypes of approximately equal frequency ("dual haplotypes") in a substantial fraction of the genome likely reflects the outbred nature of the PEST strain. The sequence produced a conservative inference of more than 400,000 single-nucleotide polymorphisms that showed a markedly bimodal density distribution. Analysis of the genome sequence revealed strong evidence for about 14,000 protein-encoding transcripts. Prominent expansions in specific families of proteins likely involved in cell adhesion and immunity were noted. An expressed sequence tag analysis of genes regulated by blood feeding provided insights into the physiological adaptations of a hematophagous insect.〈br /〉〈span class="detail_caption"〉Notes: 〈/span〉Holt, Robert A -- Subramanian, G Mani -- Halpern, Aaron -- Sutton, Granger G -- Charlab, Rosane -- Nusskern, Deborah R -- Wincker, Patrick -- Clark, Andrew G -- Ribeiro, Jose M C -- Wides, Ron -- Salzberg, Steven L -- Loftus, Brendan -- Yandell, Mark -- Majoros, William H -- Rusch, Douglas B -- Lai, Zhongwu -- Kraft, Cheryl L -- Abril, Josep F -- Anthouard, Veronique -- Arensburger, Peter -- Atkinson, Peter W -- Baden, Holly -- de Berardinis, Veronique -- Baldwin, Danita -- Benes, Vladimir -- Biedler, Jim -- Blass, Claudia -- Bolanos, Randall -- Boscus, Didier -- Barnstead, Mary -- Cai, Shuang -- Center, Angela -- Chaturverdi, Kabir -- Christophides, George K -- Chrystal, Mathew A -- Clamp, Michele -- Cravchik, Anibal -- Curwen, Val -- Dana, Ali -- Delcher, Art -- Dew, Ian -- Evans, Cheryl A -- Flanigan, Michael -- Grundschober-Freimoser, Anne -- Friedli, Lisa -- Gu, Zhiping -- Guan, Ping -- Guigo, Roderic -- Hillenmeyer, Maureen E -- Hladun, Susanne L -- Hogan, James R -- Hong, Young S -- Hoover, Jeffrey -- Jaillon, Olivier -- Ke, Zhaoxi -- Kodira, Chinnappa -- Kokoza, Elena -- Koutsos, Anastasios -- Letunic, Ivica -- Levitsky, Alex -- Liang, Yong -- Lin, Jhy-Jhu -- Lobo, Neil F -- Lopez, John R -- Malek, Joel A -- McIntosh, Tina C -- Meister, Stephan -- Miller, Jason -- Mobarry, Clark -- Mongin, Emmanuel -- Murphy, Sean D -- O'Brochta, David A -- Pfannkoch, Cynthia -- Qi, Rong -- Regier, Megan A -- Remington, Karin -- Shao, Hongguang -- Sharakhova, Maria V -- Sitter, Cynthia D -- Shetty, Jyoti -- Smith, Thomas J -- Strong, Renee -- Sun, Jingtao -- Thomasova, Dana -- Ton, Lucas Q -- Topalis, Pantelis -- Tu, Zhijian -- Unger, Maria F -- Walenz, Brian -- Wang, Aihui -- Wang, Jian -- Wang, Mei -- Wang, Xuelan -- Woodford, Kerry J -- Wortman, Jennifer R -- Wu, Martin -- Yao, Alison -- Zdobnov, Evgeny M -- Zhang, Hongyu -- Zhao, Qi -- Zhao, Shaying -- Zhu, Shiaoping C -- Zhimulev, Igor -- Coluzzi, Mario -- della Torre, Alessandra -- Roth, Charles W -- Louis, Christos -- Kalush, Francis -- Mural, Richard J -- Myers, Eugene W -- Adams, Mark D -- Smith, Hamilton O -- Broder, Samuel -- Gardner, Malcolm J -- Fraser, Claire M -- Birney, Ewan -- Bork, Peer -- Brey, Paul T -- Venter, J Craig -- Weissenbach, Jean -- Kafatos, Fotis C -- Collins, Frank H -- Hoffman, Stephen L -- R01AI44273/AI/NIAID NIH HHS/ -- U01AI48846/AI/NIAID NIH HHS/ -- U01AI50687/AI/NIAID NIH HHS/ -- New York, N.Y. -- Science. 2002 Oct 4;298(5591):129-49.〈br /〉〈span class="detail_caption"〉Author address: 〈/span〉Celera Genomics, 45 West Gude Drive, Rockville, MD 20850, USA. robert.holt@celera.com〈br /〉〈span class="detail_caption"〉Record origin:〈/span〉 〈a href="http://www.ncbi.nlm.nih.gov/pubmed/12364791" target="_blank"〉PubMed〈/a〉
    Keywords: Animals ; Anopheles/classification/*genetics/parasitology/physiology ; Biological Evolution ; Blood ; Chromosome Inversion ; Chromosomes, Artificial, Bacterial ; Computational Biology ; DNA Transposable Elements ; Digestion ; Drosophila melanogaster/genetics ; Enzymes/chemistry/genetics/metabolism ; Expressed Sequence Tags ; Feeding Behavior ; Gene Expression Regulation ; *Genes, Insect ; Genetic Variation ; *Genome ; Haplotypes ; Humans ; Insect Proteins/chemistry/genetics/physiology ; Insect Vectors/genetics/parasitology/physiology ; Malaria, Falciparum/transmission ; Molecular Sequence Data ; Mosquito Control ; Physical Chromosome Mapping ; Plasmodium falciparum/growth & development ; Polymorphism, Single Nucleotide ; Proteome ; *Sequence Analysis, DNA ; Species Specificity ; Transcription Factors/chemistry/genetics/physiology
    Print ISSN: 0036-8075
    Electronic ISSN: 1095-9203
    Topics: Biology , Chemistry and Pharmacology , Computer Science , Medicine , Natural Sciences in General , Physics
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 12 (1994), S. 345-374 
    ISSN: 1432-0541
    Keywords: Approximate match ; Dynamic programming ; Index ; word neighborhood
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a relatively short query stringW of lengthP, a long subject stringA of lengthN, and a thresholdD, theapproximate keyword search problem is to find all substrings ofA that align withW with not more than D insertions, deletions, and mismatches. In typical applications, such as searching a DNA sequence database, the size of the “database”A is much larger than that of the queryW, e.g.,N is on the order of millions or billions andP is a hundred to a thousand. In this paper we present an algorithm that given a precomputedindex of the databaseA, finds rare matches in time that issublinear inN, i.e.,N c for somec〈1. The sequenceA must be overa. finite alphabet σ. More precisely, our algorithm requires 0(DN pow(ɛ) logN) expected-time where ɛ=D/P is the maximum number of differences as a percentage of query length, and pow(ɛ) is an increasing and concave function that is 0 when ɛ=0. Thus the algorithm is superior to current O(DN) algorithms when ɛ is small enough to guarantee that pow(ɛ) 〈 1. As seen in the paper, this is true for a wide range of ɛ, e.g., ɛ. up to 33% for DNA sequences (¦⌆¦=4) and 56% for proteins sequences (¦⌆¦=20). In preliminary practical experiments, the approach gives a 50-to 500-fold improvement over previous algorithms for prolems of interest in molecular biology.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 13 (1995), S. 211-243 
    ISSN: 1432-0541
    Keywords: Pattern matching ; Dynamic programming ; Extended regular expressions ; Molecular biology ; Gene recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Some recognition problems are either too complex or too ambiguous to be expressed as a simple pattern matching problem using a sequence or regular expression pattern. In these cases, a richer environment is needed to describe the “patterns” and recognition techniques used to perform the recognition. Some researchers have turned to artificial-intelligence techniques and multistep matching approaches for the problems of gene recognition [5], [7], [18], protein structure recognition [13], and on-line character recognition [6]. This paper presents a class of problems which involve finding matches to “patterns of patterns,” orsuper- patterns, given solutions to the lower-level patterns. The expressiveness of this problem class rivals that of traditional artificial-intelligence characterizations, and yet polynomial-time algorithms are described for each problem in the class.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...