201 Publikationen

Alle markieren

[201]
2019 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2932883
A Perspective on Comparative and Functional Genomics
Dörr, Daniel, A Perspective on Comparative and Functional Genomics. Bioinformatics and Phylogenetics 29 (). , 2019
PUB | DOI
 
[200]
2019 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2932884
Whole-genome sequence of the bovine blood fluke Schistosoma bovis supports interspecific hybridization with S. haematobium
Oey, Harald, Whole-genome sequence of the bovine blood fluke Schistosoma bovis supports interspecific hybridization with S. haematobium. PLOS Pathogens 15 (1). , 2019
PUB | DOI | WoS | PubMed | Europe PMC
 
[199]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919005
GraphTeams. A method for discovering spatial gene clusters in Hi-C sequencing data
Schulz, Tizian, GraphTeams. A method for discovering spatial gene clusters in Hi-C sequencing data. BMC Genomics 19 (Suppl. 5). , 2018
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[198]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919006
Computing the family-free DCJ similarity
Rubert, Diego, Computing the family-free DCJ similarity. BMC Bioinformatics 19 (Suppl. 6). , 2018
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[197]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2918481
Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework
Luhmann, Nina, Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework. IEEE/ACM Transactions on Computational Biology and Bioinformatics 15 (6). , 2018
PUB | DOI | WoS | PubMed | Europe PMC
 
[196]
2018 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2930445
Identifying Maximal Perfect Haplotype Blocks
Cunha, Luís, Identifying Maximal Perfect Haplotype Blocks. Proceedings of BSB 2018 11228 (). , 2018
PUB | DOI
 
[195]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2930268
Dynamic Alignment-Free and Reference-Free Read Compression
Holley, Guillaume, Dynamic Alignment-Free and Reference-Free Read Compression. JOURNAL OF COMPUTATIONAL BIOLOGY 25 (7). , 2018
PUB | DOI | WoS | PubMed | Europe PMC
 
[194]
2018 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2913921
Pan-genome Storage and Analysis Techniques
Zekic, Tina, Pan-genome Storage and Analysis Techniques. Comparative Genomics. Methods and Protocols 1704 (). New York, 2018
PUB
 
[193]
2018 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2913922
Family-Free Genome Comparison
Dörr, Daniel, Family-Free Genome Comparison. Comparative Genomics: Methods and Protocols 1704 (). New York, 2018
PUB
 
[192]
2018 | Herausgeber Sammelwerk | Veröffentlicht | PUB-ID: 2913920
Comparative Genomics: Methods and Protocols
Setubal, João C, Comparative Genomics: Methods and Protocols. 1704 (). New York, 2018
PUB
 
[191]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919012
Flexible metagenome analysis using the MGX framework
Jaenicke, Sebastian, Flexible metagenome analysis using the MGX framework. Microbiome 6 (). , 2018
PUB | DOI | WoS | PubMed | Europe PMC
 
[190]
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2913556
Bioinformatics for NGS-based metagenomics and the application to biogas research
Jünemann, Sebastian, Bioinformatics for NGS-based metagenomics and the application to biogas research. Journal of Biotechnology 261 (SI). , 2017
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[189]
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2913015
Algorithms for Computing the Family-Free Genomic Similarity under DCJ
Rubert, Diego, Algorithms for Computing the Family-Free Genomic Similarity under DCJ. Comparative Genomics. RECOMB-CG 2017 10562 (). Cham, 2017
PUB | DOI
 
[188]
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909057
Approximating the DCJ distance of balanced genomes in linear time
Rubert, Diego, Approximating the DCJ distance of balanced genomes in linear time. Algorithms for Molecular Biology 12 (). , 2017
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[187]
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2909409
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings
Cunha, Luis, Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. Proceedings of CPM 2017 78 (). , 2017
PUB | DOI
 
[186]
2017 | Preprint | Veröffentlicht | PUB-ID: 2908521
Faster Jumbled Indexing for Binary Run-Length Encoded Strings
Cunha, Luís, Faster Jumbled Indexing for Binary Run-Length Encoded Strings. arXiv: 1702.01280 (). , 2017
PUB
 
[185]
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2907587
Dynamic Alignment-Free and Reference-Free Read Compression
Holley, Guillaume, Dynamic Alignment-Free and Reference-Free Read Compression. Proceedings of RECOMB 2017 10229 (). , 2017
PUB | DOI
 
[184]
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2913016
Finding Teams in Graphs and its Application to Spatial Gene Cluster Discovery
Schulz, Tizian, Finding Teams in Graphs and its Application to Spatial Gene Cluster Discovery. Proceedings of RECOMB-CG 2017 1704 (). Berlin, 2017
PUB | DOI
 
[183]
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909967
New Genome Similarity Measures based on Conserved Gene Adjacencies
Dörr, Daniel, New Genome Similarity Measures based on Conserved Gene Adjacencies. Journal of Computational Biology 24 (6). , 2017
PUB | DOI | WoS | PubMed | Europe PMC
 
[182]
2016 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2905930
Finding approximate gene clusters with GECKO 3
Winter, Sascha, Finding approximate gene clusters with GECKO 3. Nucleic Acids Research 44 (20). , 2016
PUB | DOI | WoS | PubMed | Europe PMC
 
[181]
2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903708
A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates
Rubert, Diego, A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. Algorithms in Bioinformatics. WABI 2016 9838 (). Cham, 2016
PUB | DOI
 
[180]
2016 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2900129
Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage
Holley, Guillaume, Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage. Algorithms for Molecular Biology 11 (). , 2016
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[179]
2016 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2900421
Identification of the CIMP-like subtype and aberrant methylation of members of the chromosomal segregation and spindle assembly pathways in esophageal adenocarcinoma
Krause, Lutz, Identification of the CIMP-like subtype and aberrant methylation of members of the chromosomal segregation and spindle assembly pathways in esophageal adenocarcinoma. Carcinogenesis 37 (4). , 2016
PUB | DOI | WoS | PubMed | Europe PMC
 
[178]
2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2900111
New Genome Similarity Measures based on Conserved Gene Adjacencies
Kowada, Luis Antonio B., New Genome Similarity Measures based on Conserved Gene Adjacencies. Research in Computational Molecular Biology. RECOMB 2016 9649 (). , 2016
PUB | DOI
 
[177]
2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2677844
Sorting linear genomes with rearrangements and indels
Dias Vieira Braga, Marília, Sorting linear genomes with rearrangements and indels. IEEE/ACM Transactions on Computational Biology and Bioinformatics 12 (3). , 2015
PUB | DOI | WoS | PubMed | Europe PMC
 
[176]
2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2726366
On the family-free DCJ distance and similarity
Viduani Martinez, Fábio Henrique, On the family-free DCJ distance and similarity. Algorithms for Molecular Biology 10 (). , 2015
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[175]
2015 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2757497
Bloom Filter Trie - a data structure for pan-genome storage
Holley, Guillaume, Bloom Filter Trie - a data structure for pan-genome storage. Proceedings of WABI 2015 9289 (). , 2015
PUB
 
[174]
2015 | Konferenzband | Veröffentlicht | PUB-ID: 2780229
Proceedings of the 13th Annual Research in Computational Molecular Biology (RECOMB) Satellite Workshop on Comparative Genomics: Bioinformatics
Meidanis, Joao, Proceedings of the 13th Annual Research in Computational Molecular Biology (RECOMB) Satellite Workshop on Comparative Genomics: Bioinformatics. 16 (Supplement 14). , 2015
PUB | Download (ext.)
 
[173]
2015 | Konferenzband | Veröffentlicht | PUB-ID: 2780232
Proceedings of the 13th Annual Research in Computational Molecular Biology (RECOMB) Satellite Workshop on Comparative Genomics: Genomics
Meidanis, Joao, Proceedings of the 13th Annual Research in Computational Molecular Biology (RECOMB) Satellite Workshop on Comparative Genomics: Genomics. 16 (Supplement 10). , 2015
PUB | Download (ext.)
 
[172]
2014 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2684241
On the family-free DCJ distance
Viduani Martinez, Fábio Henrique, On the family-free DCJ distance. Algorithms in Bioinformatics. WABI 2014 8701 (). Berlin ; Heidelberg, 2014
PUB | DOI
 
[171]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2687033
Identifying Gene Clusters by Discovering Common Intervals in Indeterminate Strings
Dörr, Daniel, Identifying Gene Clusters by Discovering Common Intervals in Indeterminate Strings. BMC Genomics 15 (Suppl. 6: Proc. of RECOMB-CG 2014). , 2014
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[170]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2685362
Orthology Detection Combining Clustering and Synteny for Very Large Datasets
Lechner, Marcus, Orthology Detection Combining Clustering and Synteny for Very Large Datasets. PLoS ONE 9 (8). , 2014
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[169]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2689773
GABenchToB: A Genome Assembly Benchmark Tuned on Bacteria and Benchtop Sequencers
Jünemann, Sebastian, GABenchToB: A Genome Assembly Benchmark Tuned on Bacteria and Benchtop Sequencers. PLOS ONE 9 (9). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[168]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2674387
ReadXplorer - Visualization and Analysis of Mapped Sequences
Hilker, Rolf, ReadXplorer - Visualization and Analysis of Mapped Sequences. Bioinformatics 30 (16). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[167]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2665038
Improving the genome annotation of the acarbose producer Actinoplanes sp. SE50/110 by sequencing enriched 5'-ends of primary transcripts
Schwientek, Patrick, Improving the genome annotation of the acarbose producer Actinoplanes sp. SE50/110 by sequencing enriched 5'-ends of primary transcripts. Journal of Biotechnology 190 (). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[166]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2685988
Discovery of transcription start sites in the Chinese hamster genome by next-generation RNA sequencing
Jakobi, Tobias, Discovery of transcription start sites in the Chinese hamster genome by next-generation RNA sequencing. Journal of Biotechnology 190 (). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[165]
2014 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2690122
Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework
Luhmann, Nina, Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework. Proc. of BSB 2014 8826 (). , 2014
PUB | DOI
 
[164]
2014 | Lexikoneintrag | Veröffentlicht | PUB-ID: 2693552
Suffix Tree Construction
Stoye, Jens, Suffix Tree Construction. Encyclopedia of Algorithms (). , 2014
PUB | DOI
 
[163]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2643941
BiPACE 2D – Graph-based multiple alignment for comprehensive two-dimensional gas chromatography–mass spectrometry
Hoffmann, Nils, BiPACE 2D – Graph-based multiple alignment for comprehensive two-dimensional gas chromatography–mass spectrometry. Bioinformatics 30 (7). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[162]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2693409
Metatranskriptomik der Mikrobiota aus der menschlichen Achselhöhle
Fredrich, Eugenie, Metatranskriptomik der Mikrobiota aus der menschlichen Achselhöhle. BIOspektrum 20 (5). , 2014
PUB | DOI
 
[161]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2665333
Mycoplasma salivarium as a Dominant Coloniser of Fanconi Anaemia Associated Oral Carcinoma
Henrich, Birgit, Mycoplasma salivarium as a Dominant Coloniser of Fanconi Anaemia Associated Oral Carcinoma. PLoS ONE 9 (3). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[160]
2013 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2611641
Restricted DCJ-Indel Model Revisited
Dias Vieira Braga, Marília, Restricted DCJ-Indel Model Revisited. Advances in Bioinformatics and Computational Biology. BSB 2013 8213 (). Cham, 2013
PUB | DOI
 
[159]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2611630
On the Inversion-Indel Distance
Willing, Eyla, On the Inversion-Indel Distance. BMC Bioinformatics 14 (Suppl 15: Proc. of RECOMB-CG 2013). , 2013
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[158]
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2611648
The Potential of Family-Free Genome Comparison
Dias Vieira Braga, Marília, The Potential of Family-Free Genome Comparison. Models and Algorithms for Genome Evolution 19 (). , 2013
PUB | DOI
 
[157]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2575011
metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences
Ander, Christina, metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences. BMC Bioinformatics 14 (Suppl 5: Proc. of RECOMB-Seq 2013). , 2013
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[156]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2641228
Corrigendum: Updating benchtop sequencing performance comparison
Jünemann, Sebastian, Corrigendum: Updating benchtop sequencing performance comparison. Nature biotechnology 31 (12). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[155]
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2611643
The Genesis of the DCJ Formula
Bergeron, Anne, The Genesis of the DCJ Formula. Models and Algorithms for Genome Evolution 19 (). , 2013
PUB | DOI
 
[154]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2575361
Next-generation-sequencing-spectratyping reveals public T-cell receptor repertoires in pediatric very severe aplastic anemia and identifies a beta chain CDR3 sequence associated with hepatitis-induced pathogenesis
Krell, Pina, Next-generation-sequencing-spectratyping reveals public T-cell receptor repertoires in pediatric very severe aplastic anemia and identifies a beta chain CDR3 sequence associated with hepatitis-induced pathogenesis. Haematologica 98 (9). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[153]
2013 | Lexikoneintrag | Veröffentlicht | PUB-ID: 2577323
Taxonomic classification of metagenomic shotgun sequences with CARMA3
Gerlach, Wolfgang, Taxonomic classification of metagenomic shotgun sequences with CARMA3. Encyclopedia of Metagenomics (). , 2013
PUB | DOI
 
[152]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2566922
Updating benchtop sequencing performance comparison
Jünemann, Sebastian, Updating benchtop sequencing performance comparison. Nature Biotechnology 31 (4). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[151]
2013 | Konferenzband | Veröffentlicht | PUB-ID: 2616537
Algorithms in Bioinformatics
Darling, Aaron, Algorithms in Bioinformatics. 8126 (). Heidelberg, 2013
PUB | DOI
 
[150]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2611633
Statistics for approximate gene clusters
Jahn, Katharina, Statistics for approximate gene clusters. BMC Bioinformatics 14 (Suppl 15: Proc. of RECOMB-CG 2013). , 2013
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[149]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2548236
Comparative RNA-sequencing of the acarbose producer Actinoplanes sp. SE50/110 cultivated in different growth media
Schwientek, Patrick, Comparative RNA-sequencing of the acarbose producer Actinoplanes sp. SE50/110 cultivated in different growth media. Journal of Biotechnology 167 (2). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[148]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2529202
MetaSAMS - A novel software platform for taxonomic classification, functional annotation and comparative analysis of metagenome datasets
Zakrzewski, Martha, MetaSAMS - A novel software platform for taxonomic classification, functional annotation and comparative analysis of metagenome datasets. Journal of Biotechnology 167 (2). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[147]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2512642
Gene family assignment-free comparative genomics
Dörr, Daniel, Gene family assignment-free comparative genomics. BMC Bioinformatics 13 (Suppl 19: Proc. of RECOMB-CG 2012). , 2012
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[146]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2517239
Combining peak- and chromatogram-based retention time alignment algorithms for multiple chromatography-mass spectrometry datasets
Hoffmann, Nils, Combining peak- and chromatogram-based retention time alignment algorithms for multiple chromatography-mass spectrometry datasets. BMC Bioinformatics 13 (1). , 2012
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[145]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2512644
Multiple genome comparison based on overlap regions of pairwise local alignments
Jahn, Katharina, Multiple genome comparison based on overlap regions of pairwise local alignments. BMC Bioinformatics 13 (Suppl. 19: Proc. of RECOMB-CG 2012). , 2012
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[144]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2486060
The complete genome sequence of the acarbose producer Actinoplanes sp. SE50/110
Schwientek, Patrick, The complete genome sequence of the acarbose producer Actinoplanes sp. SE50/110. BMC Genomics 13 (1). , 2012
PUB | PDF | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[143]
2012 | Konferenzband | Veröffentlicht | PUB-ID: 2510416
Combinatorial Pattern Matching
Kärkkäinen, Juha, Combinatorial Pattern Matching. 7354 (). Heidelberg, 2012
PUB | DOI
 
[142]
2012 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2468382
Generic Software Frameworks for GC-MS Based Metabolomics
Hoffmann, Nils, Generic Software Frameworks for GC-MS Based Metabolomics. Metabolomics (). , 2012
PUB | PDF | DOI | Download (ext.)
 
[141]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2510984
UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ
Hilker, Rolf, UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ. Bioinformatics 28 (19). , 2012
PUB | DOI | WoS | PubMed | Europe PMC
 
[140]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2517230
Bacterial Community Shift in Treated Periodontitis Patients Revealed by Ion Torrent 16S rRNA Gene Amplicon Sequencing
Jünemann, Sebastian, Bacterial Community Shift in Treated Periodontitis Patients Revealed by Ion Torrent 16S rRNA Gene Amplicon Sequencing. PLoS ONE 7 (8). , 2012
PUB | DOI | WoS | PubMed | Europe PMC
 
[139]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2396558
On the weight of indels in genomic distances
Dias Vieira Braga, Marília, On the weight of indels in genomic distances. BMC Bioinformatics 12 (Suppl 9: RECOMB-CG 2011). , 2011
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[138]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2396509
Genomic distance under gene substitutions
Dias Vieira Braga, Marília, Genomic distance under gene substitutions. BMC Bioinformatics 12 (Suppl 9: Proc. of RECOMB-CG 2011). , 2011
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[137]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091794
Double Cut and Join with Insertions and Deletions
Dias Vieira Braga, Marília, Double Cut and Join with Insertions and Deletions. Journal of Computational Biology 18 (9). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[136]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091790
Restricted DCJ Model. Rearrangement Problems with Chromosome Reincorporation
Kovac, Jakub, Restricted DCJ Model. Rearrangement Problems with Chromosome Reincorporation. Journal of Computational Biology 18 (9). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[135]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2354746
Sequencing of high G + C microbial genomes using the ultrafast pyrosequencing technology
Schwientek, Patrick, Sequencing of high G + C microbial genomes using the ultrafast pyrosequencing technology. Journal of Biotechnology 155 (1). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[134]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2289952
Exact and complete short-read alignment to microbial genomes using Graphics Processing Unit programming
Blom, Jochen, Exact and complete short-read alignment to microbial genomes using Graphics Processing Unit programming. Bioinformatics 27 (10). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[133]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918550
Common Intervals of Multiple Permutations
Heber, Steffen, Common Intervals of Multiple Permutations. Algorithmica 60 (2). , 2011
PUB | DOI | WoS
 
[132]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2298170
Taxonomic classification of metagenomic shotgun sequences with CARMA3.
Gerlach, Wolfgang, Taxonomic classification of metagenomic shotgun sequences with CARMA3.. Nucleic Acids Res 39 (14). , 2011
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[131]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1897974
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
Erdős, Péter L., Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. Applied Mathematics Letters 24 (1). , 2011
PUB | DOI | WoS
 
[130]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091787
Consistency of Sequence-Based Gene Clusters
Wittler, Roland, Consistency of Sequence-Based Gene Clusters. Journal of Computational Biology 18 (9). , 2011
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[129]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091779
Swiftly Computing Center Strings
Hufsky, Franziska, Swiftly Computing Center Strings. BMC Bioinformatics 12 (1). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[128]
2010 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 2445157
Computing the Genomic Distance in Linear Time
Bergeron, Anne, Computing the Genomic Distance in Linear Time. Dagstuhl Seminar Proceedings: 10231 Abstracts Collection : Structure Discovery in Biology: Motifs, Networks & Phylogenies 10231 (). Dagstuhl, 2010
PUB | Download (ext.)
 
[127]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1893893
Phylogenetic Comparative Assembly
Husemann, Peter, Phylogenetic Comparative Assembly. Algorithms for Molecular Biology 5 (1). , 2010
PUB | PDF | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[126]
2010 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918836
Indexing and Searching a Mass Spectrometry Database
Besenbacher, Søren, Indexing and Searching a Mass Spectrometry Database. Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday 6060 (). , 2010
PUB | DOI
 
[125]
2010 | Report | Veröffentlicht | PUB-ID: 1966434
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
Erdős, Péter L., Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. (). , 2010
PUB | arXiv
 
[124]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1966439
The complete genome sequence of Corynebacterium pseudotuberculosis FRC41 isolated from a 12-year-old girl with necrotizing lymphadenitis reveals insights into gene-regulatory networks contributing to virulence
Trost, Eva, The complete genome sequence of Corynebacterium pseudotuberculosis FRC41 isolated from a 12-year-old girl with necrotizing lymphadenitis reveals insights into gene-regulatory networks contributing to virulence. BMC Genomics 11 (1). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[123]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1795670
Partitioning Biological Data with Transitivity Clustering
Wittkop, Tobias, Partitioning Biological Data with Transitivity Clustering. Nature Methods 7 (6). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[122]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898012
Finding Nested Common Intervals Efficiently
Blin, Guillaume, Finding Nested Common Intervals Efficiently. Journal of Computational Biology 17 (9). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[121]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919217
Consistency of Sequence-based Gene Clusters
Wittler, Roland, Consistency of Sequence-based Gene Clusters. Proc. of Recomb-CG 2010 6398 (). , 2010
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[120]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1893890
Repeat-aware Comparative Genome Assembly
Husemann, Peter, Repeat-aware Comparative Genome Assembly. Proc. of GCB 2010 P-173 (). , 2010
PUB | Download (ext.)
 
[119]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1588556
r2cat: Synteny Plots and Comparative Assembly
Husemann, Peter, r2cat: Synteny Plots and Comparative Assembly. Bioinformatics 26 (4). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[118]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1897997
Rearrangement Models and Single-Cut Operations
Bergeron, Anne, Rearrangement Models and Single-Cut Operations. Journal of Computational Biology 17 (9). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[117]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919211
Swiftly Computing Center Strings
Hufsky, Franziska, Swiftly Computing Center Strings. Proc. of WABI 2010 6293 (). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[116]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919216
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving
Kovac, Jakub, The Problem of Chromosome Reincorporation in DCJ Sorting and Halving. Proc. of Recomb-CG 2010 6398 (). , 2010
PUB | DOI
 
[115]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898025
The Solution Space of Sorting by DCJ
Dias Vieira Braga, Marília, The Solution Space of Sorting by DCJ. Journal of Computational Biology 17 (9). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[114]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919215
Genomic Distance with DCJ and Indels
Dias Vieira Braga, Marília, Genomic Distance with DCJ and Indels. Proc. of WABI 2010 6293 (). , 2010
PUB | DOI
 
[113]
2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919206
Counting All DCJ Sorting Scenarios
Dias Vieira Braga, Marília, Counting All DCJ Sorting Scenarios. Proc. of Recomb-CG 2009 5817 (). , 2009
PUB | DOI
 
[112]
2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919207
Finding Nested Common Intervals Efficiently
Blin, Guillaume, Finding Nested Common Intervals Efficiently. Proc. of Recomb-CG 2009 5817 (). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[111]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898137
Approximative Gencluster und ihre Anwendung in der komparativen Genomik
Jahn, Katharina, Approximative Gencluster und ihre Anwendung in der komparativen Genomik. Informatik-Spektrum 32 (4). , 2009
PUB | DOI
 
[110]
2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1893884
Phylogenetic Comparative Assembly
Husemann, Peter, Phylogenetic Comparative Assembly. Proc. of WABI 2009 5724 (). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[109]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1591507
A Unified Approach for Reconstructing Ancient Gene Clusters
Stoye, Jens, A Unified Approach for Reconstructing Ancient Gene Clusters. IEEE/ACM Transactions on Computational Biology and Bioinformatics 6 (3). , 2009
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[108]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1589098
WebCARMA: a web application for the functional and taxonomic classification of unassembled metagenomic reads
Gerlach, Wolfgang, WebCARMA: a web application for the functional and taxonomic classification of unassembled metagenomic reads. BMC Bioinformatics 10 (1). , 2009
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[107]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1589663
A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance
Bergeron, Anne, A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. Theoretical Computer Science 410 (51). , 2009
PUB | DOI | WoS
 
[106]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1590204
A report on the 2009 SIG on short read sequencing and algorithms (Short-SIG)
Brudno, Michael, A report on the 2009 SIG on short read sequencing and algorithms (Short-SIG). BIOINFORMATICS 25 (21). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[105]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898105
Computation of Median Gene Clusters
Böcker, Sebastian, Computation of Median Gene Clusters. Journal of Computational Biology 16 (8). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[104]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1591319
ChromA: signal-based retention time alignment for chromatography-mass spectrometry data
Hoffmann, Nils, ChromA: signal-based retention time alignment for chromatography-mass spectrometry data. Bioinformatics 25 (16). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[103]
2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919209
Rearrangement Models and Single-Cut Operations
Medvedev, Paul, Rearrangement Models and Single-Cut Operations. Comparative Genomics : International Workshop, RECOMB-CG 2009, Budapest, Hungary, September 27-29, 2009. Proceedings 5817 (). Berlin, Heidelberg, 2009
PUB | DOI
 
[102]
2009 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 1918945
Computational Short Read Metagenomics
Stoye, Jens, Computational Short Read Metagenomics. (). , 2009
PUB
 
[101]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634447
The Sequence Analysis and Management System - SAMS-2.0: Data management and sequence analysis adapted to changing requirements from traditional sanger sequencing to ultrafast sequencing technologies
Bekel, Thomas, The Sequence Analysis and Management System - SAMS-2.0: Data management and sequence analysis adapted to changing requirements from traditional sanger sequencing to ultrafast sequencing technologies. Journal of Biotechnology 140 (1-2). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[100]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919198
Detecting Repeat Families in Incompletely Sequenced Genomes
Quitzau, José Augusto Amgarten, Detecting Repeat Families in Incompletely Sequenced Genomes. Proc. of WABI 2008 5251 (). , 2008
PUB | DOI
 
[99]
2008 | Report | PUB-ID: 1970459
A space efficient representation for sparse de Bruijn subgraphs
Quitzau, José Augusto Amgarten, A space efficient representation for sparse de Bruijn subgraphs. (). Bielefeld, 2008
PUB | PDF
 
[98]
2008 | Report | PUB-ID: 1970461
Online Abelian Pattern Matching
Ejaz, Tahir, Online Abelian Pattern Matching. (). Bielefeld, 2008
PUB | PDF
 
[97]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636699
MeltDB: a software platform for the analysis and integration of metabolomics experiment data
Neuweger, Heiko, MeltDB: a software platform for the analysis and integration of metabolomics experiment data. Bioinformatics 24 (23). , 2008
PUB | DOI | WoS | PubMed | Europe PMC
 
[96]
2008 | Lexikoneintrag | Veröffentlicht | PUB-ID: 1918834
Suffix Tree Construction in RAM (1997; Farach-Colton)
Stoye, Jens, Suffix Tree Construction in RAM (1997; Farach-Colton). Encyclopedia of Algorithms (). , 2008
PUB | DOI
 
[95]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919192
Computation of Median Gene Clusters
Böcker, Sebastian, Computation of Median Gene Clusters. Proc. of RECOMB 2008 4955 (). , 2008
PUB | DOI
 
[94]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919200
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
Bergeron, Anne, On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios. Proc. of Recomb-CG 2008 5267 (). , 2008
PUB | DOI
 
[93]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587078
Counting suffix arrays and strings
Schürmann, Klaus-Bernd, Counting suffix arrays and strings. THEORETICAL COMPUTER SCIENCE 395 (2-3). , 2008
PUB | DOI | WoS
 
[92]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1586009
Taxonomic composition and gene content of a methane-producing microbial community isolated from a biogas reactor
Krause, Lutz, Taxonomic composition and gene content of a methane-producing microbial community isolated from a biogas reactor. JOURNAL OF BIOTECHNOLOGY 136 (1-2). , 2008
PUB | DOI | WoS | PubMed | Europe PMC
 
[91]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1586785
Comparative Pathway Analyzer - a web server for comparative analysis, clustering and visualization of metabolic networks in multiple organisms
Oehm, Sebastian, Comparative Pathway Analyzer - a web server for comparative analysis, clustering and visualization of metabolic networks in multiple organisms. NUCLEIC ACIDS RESEARCH 36 (Web Server). , 2008
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[90]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1783364
Phylogenetic classification of short environmental DNA fragments
Krause, Lutz, Phylogenetic classification of short environmental DNA fragments. Nucleic Acids Research 36 (7). , 2008
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[89]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919195
HP Distance via Double Cut and Join Distance
Bergeron, Anne, HP Distance via Double Cut and Join Distance. Combinatorial Pattern Matching. 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008 Proceedings (). , 2008
PUB | DOI
 
[88]
2007 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918828
Chapter 12: Gecko and GhostFam - Rigorous and Efficient Gene Cluster Detection in Prokaryotic Genomes
Schmidt, Thomas, Chapter 12: Gecko and GhostFam - Rigorous and Efficient Gene Cluster Detection in Prokaryotic Genomes. Comparative Genomics, Volume 2 396 (). Totowa, NJ, 2007
PUB | DOI | PubMed | Europe PMC
 
[87]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918432
Character Sets of Strings
Didier, Gilles, Character Sets of Strings. Journal of Discrete Algorithms 5 (2). , 2007
PUB | DOI
 
[86]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1595253
An incomplex algorithm for fast suffix array construction
Schürmann, Klaus-Bernd, An incomplex algorithm for fast suffix array construction. SOFTWARE-PRACTICE & EXPERIENCE 37 (3). , 2007
PUB | DOI | WoS
 
[85]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1783345
GISMO - gene identification using a support vector machine for ORF classification
Krause, Lutz, GISMO - gene identification using a support vector machine for ORF classification. Nucleic Acids Research 35 (2). , 2007
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[84]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1630781
Based Upon Repeat Pattern (BURP): an algorithm to characterize the long-term evolution of Staphylococcus aureus populations based on spa polymorphisms
Mellmann, Alexander, Based Upon Repeat Pattern (BURP): an algorithm to characterize the long-term evolution of Staphylococcus aureus populations based on spa polymorphisms. BMC MICROBIOLOGY 7 (1). , 2007
PUB | DOI | WoS | PubMed | Europe PMC
 
[83]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599943
Panta rhei (QAlign2): an open graphical environment for sequence analysis
Sammeth, Michael, Panta rhei (QAlign2): an open graphical environment for sequence analysis. BIOINFORMATICS 22 (7). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[82]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599570
Efficient q-gram filters for finding all epsilon-matches over a given length
Rasmussen, Kim R., Efficient q-gram filters for finding all epsilon-matches over a given length. JOURNAL OF COMPUTATIONAL BIOLOGY 13 (2). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[81]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599574
On sorting by translocations
Bergeron, Anne, On sorting by translocations. JOURNAL OF COMPUTATIONAL BIOLOGY 13 (2). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[80]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597213
Comparing tandem repeats with duplications and excisions of variable degree
Sammeth, Michael, Comparing tandem repeats with duplications and excisions of variable degree. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3 (4). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[79]
2006 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1596811
A Unifying View of Genome Rearrangements
Bergeron, Anne, A Unifying View of Genome Rearrangements. Proc. of WABI 2006 4175 (). , 2006
PUB | DOI | WoS
 
[78]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597313
On the similarity of sets of permutations and its applications to genome comparison
Bergeron, Anne, On the similarity of sets of permutations and its applications to genome comparison. JOURNAL OF COMPUTATIONAL BIOLOGY 13 (7). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[77]
2006 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 1918946
Index Structures in Biological Sequence Analysis: From Simplicity to Complexity and Back
Stoye, Jens, Index Structures in Biological Sequence Analysis: From Simplicity to Complexity and Back. (). , 2006
PUB
 
[76]
2006 | Report | PUB-ID: 1970464
On Common Intervals with Errors
Chauve, Cedric, On Common Intervals with Errors. (). Bielefeld, 2006
PUB | PDF
 
[75]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1631957
Finding novel genes in bacterial communities isolated from the environment
Krause, Lutz, Finding novel genes in bacterial communities isolated from the environment. BIOINFORMATICS 22 (14). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[74]
2005 | Report | PUB-ID: 1970470
Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI)
Sammeth, Michael, Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI). (). Bielefeld, 2005
PUB | PDF | DOI
 
[73]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919012
An Incomplex Algorithm for Fast Suffix Array Construction
Schürmann, Klaus-Bernd, An Incomplex Algorithm for Fast Suffix Array Construction. Proc. of ALENEX/ANALCO 2005 (). , 2005
PUB
 
[72]
2005 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918824
Chapter 10: The Inversion Distance Problem
Bergeron, Anne, Chapter 10: The Inversion Distance Problem. Mathematics of Evolution and Phylogeny (). , 2005
PUB
 
[71]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1603220
On Sorting by Translocations
Bergeron, Anne, On Sorting by Translocations. Proc. of RECOMB 2005 3500 (). , 2005
PUB | DOI | WoS
 
[70]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775168
Large scale hierarchical clustering of protein sequences
Krause, Antje, Large scale hierarchical clustering of protein sequences. BMC Bioinformatics 6 (1). , 2005
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[69]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773302
BACCardI - a tool for the validation of genomic assemblies, assisting genome finishing and intergenome comparison
Bartels, Daniela, BACCardI - a tool for the validation of genomic assemblies, assisting genome finishing and intergenome comparison. Bioinformatics 21 (7). , 2005
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[68]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918947
Informatische Methoden zur Protein-Identifikation
Böcker, Sebastian, Informatische Methoden zur Protein-Identifikation. LaborPraxis 29 (10). , 2005
PUB
 
[67]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1601348
Protein Annotation by Secondary Structure Based Alignments (PASSTA)
Bannert, Constantin, Protein Annotation by Secondary Structure Based Alignments (PASSTA). Proc. of CompLife 2005 3695 (). , 2005
PUB | DOI | WoS
 
[66]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1601361
Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI)
Sammeth, Michael, Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI). Proc. of WABI 2005 3692 (). , 2005
PUB | DOI | WoS
 
[65]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1603216
Efficient q-Gram Filters for Finding All ε-Matches Over a Given Length
Rasmussen, Kim R., Efficient q-Gram Filters for Finding All ε-Matches Over a Given Length. Proc. of RECOMB 2005 3500 (). , 2005
PUB | DOI | WoS
 
[64]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919026
Counting Suffix Arrays and Strings
Schürmann, Klaus-Bernd, Counting Suffix Arrays and Strings. Proc. of SPIRE 2005 3772 (). , 2005
PUB | DOI
 
[63]
2005 | Report | PUB-ID: 1970472
Counting Suffix Arrays and Strings
Schürmann, Klaus-Bernd, Counting Suffix Arrays and Strings. (). Bielefeld, 2005
PUB | PDF
 
[62]
2004 | Konferenzband | Veröffentlicht | PUB-ID: 1918823
Proceedings of the German Conference on Bioinformatics, GCB 2004
Giegerich, Robert, Proceedings of the German Conference on Bioinformatics, GCB 2004. P-53 (). Bonn, 2004
PUB
 
[61]
2004 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1607260
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
Schmidt, Thomas, Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences. Proc. of CPM 2004 3109 (). , 2004
PUB | DOI | WoS
 
[60]
2004 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1606286
Suboptimal Local Alignments across Multiple Scoring Schemes
Michael, Morris, Suboptimal Local Alignments across Multiple Scoring Schemes. Proc. of WABI 2004 3240 (). , 2004
PUB | DOI | WoS
 
[59]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773554
Correction: Benchmarking tools for the alignment of functional noncoding DNA
Pollard, Daniel A., Correction: Benchmarking tools for the alignment of functional noncoding DNA. BMC Bioinformatics 5 (1). , 2004
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[58]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773560
Algorithmic complexity of protein identification: combinatorics of weighted strings
Cieliebak, Mark, Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics 137 (1). , 2004
PUB | PDF | DOI | WoS
 
[57]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773312
Benchmarking tools for the alignment of functional noncoding DNA
Pollard, Daniel A., Benchmarking tools for the alignment of functional noncoding DNA. BMC Bioinformatics 5 (1). , 2004
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[56]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773569
Linear time algorithms for finding and representing all the tandem repeats in a string
Gusfield, Dan, Linear time algorithms for finding and representing all the tandem repeats in a string. Journal of computer and system sciences 69 (4). , 2004
PUB | PDF | DOI | WoS
 
[55]
2004 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1607263
Reversal Distance without Hurdles and Fortresses
Bergeron, Anne, Reversal Distance without Hurdles and Fortresses. Proc. of CPM 2004 3109 (). , 2004
PUB | DOI | WoS
 
[54]
2003 | Report | PUB-ID: 1970475
Suffix Tree Construction and Storage with Limited Main Memory
Schürmann, Klaus-Bernd, Suffix Tree Construction and Storage with Limited Main Memory. (). Bielefeld, 2003
PUB | PDF
 
[53]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1612664
The European Conference on Computational Biology
Heber, Steffen, The European Conference on Computational Biology. Drug Discovery Today 8 (3). , 2003
PUB | DOI | WoS | PubMed | Europe PMC
 
[52]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918949
Finden, fast ohne zu suchen: Indexstrukturen in der Bioinformatik
Giegerich, Robert, Finden, fast ohne zu suchen: Indexstrukturen in der Bioinformatik. Forschung an der Universität Bielefeld 26 (). , 2003
PUB
 
[51]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919005
Evaluation of the Jumping Alignment Algorithm with Artificial and Biological Data
Bannert, Constantin, Evaluation of the Jumping Alignment Algorithm with Artificial and Biological Data. Proc. of GCB 2003 (). , 2003
PUB
 
[50]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1610397
Efficient implementation of lazy suffix trees
Giegerich, Robert, Efficient implementation of lazy suffix trees. SOFTWARE-PRACTICE & EXPERIENCE 33 (11). , 2003
PUB | PDF | DOI | WoS
 
[49]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1609403
Divide-and-conquer multiple alignment with segment-based constraints
Sammeth, Michael, Divide-and-conquer multiple alignment with segment-based constraints. BIOINFORMATICS 19 (Suppl 2). , 2003
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[48]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1610433
On the similarity of sets of permutations and its applications to genome comparison
Bergeron, Anne, On the similarity of sets of permutations and its applications to genome comparison. Proc. of COCOON 2003 2697 (). , 2003
PUB | DOI | WoS
 
[47]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1610503
QAlign: quality-based multiple alignments with dynamic phylogenetic analysis
Sammeth, Michael, QAlign: quality-based multiple alignments with dynamic phylogenetic analysis. BIOINFORMATICS 19 (12). , 2003
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[46]
2003 | Report | PUB-ID: 1970477
On the Similarity of Sets of Permutations and its Applications to Genome Comparison
Bergeron, Anne, On the Similarity of Sets of Permutations and its Applications to Genome Comparison. (). Bielefeld, 2003
PUB | PDF
 
[45]
2002 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 1918951
Index Structures for Large Sequence Data: Suffix Trees and Affix Trees
Stoye, Jens, Index Structures for Large Sequence Data: Suffix Trees and Affix Trees. Lecture Notes in Informatics P-20 (Ergänzungsband). , 2002
PUB
 
[44]
2002 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919000
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings
Cieliebak, Marc, Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. Proc. of IFIP TCS 2002 (). , 2002
PUB
 
[43]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773578
A novel approach to remote homology detection: jumping alignments
Spang, Rainer, A novel approach to remote homology detection: jumping alignments. Journal of Computational Biology 9 (5). , 2002
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[42]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773332
Simple and flexible detection of contiguous repeats using a suffix tree
Stoye, Jens, Simple and flexible detection of contiguous repeats using a suffix tree. Theoretical Computer Science 270 (1-2). , 2002
PUB | PDF | DOI | WoS
 
[41]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773329
Common intervals and sorting by reversals: a marriage of necessity
Bergeron, Anne, Common intervals and sorting by reversals: a marriage of necessity. Bioinformatics 18 (Suppl 2). , 2002
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[40]
2002 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918995
Resampling Methods in Physical Mapping
Heber, Steffen, Resampling Methods in Physical Mapping. Proc. of GfKl 2000 (). , 2002
PUB
 
[39]
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773335
REPuter: the manifold applications of repeat analysis on a genomic scale
Kurtz, Stefan, REPuter: the manifold applications of repeat analysis on a genomic scale. Nucleic Acids Research 29 (22). , 2001
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[38]
2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918992
Finding all Common Intervals of k Permutations
Heber, Steffen, Finding all Common Intervals of k Permutations. Proc. of CPM 2001 2089 (). , 2001
PUB | DOI
 
[37]
2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1880197
Algorithms for Finding Gene Clusters
Heber, Steffen, Algorithms for Finding Gene Clusters. Proc. of WABI 2001 2149 (). Berlin, 2001
PUB | DOI
 
[36]
2001 | Report | PUB-ID: 1970479
Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings
Cieliebak, Marc, Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings. (). ETH Zürich, Dept. of Computer Science, 2001
PUB
 
[35]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918981
Contig Selection in Physical Mapping
Heber, Steffen, Contig Selection in Physical Mapping. Proc. of RECOMB 2000 (). , 2000
PUB | DOI | WoS | PubMed | Europe PMC
 
[34]
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918817
Finding Maximal Pairs with Bounded Gap
Brodal, Gerth S., Finding Maximal Pairs with Bounded Gap. Matching Patterns (Journal of Discrete Algorithms) (). , 2000
PUB
 
[33]
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773345
The SYSTERS protein sequence cluster set
Krause, Antje, The SYSTERS protein sequence cluster set. Nucleic Acids Research 28 (1). , 2000
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[32]
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773572
Contig selection in physical mapping
Heber, Steffen, Contig selection in physical mapping. Journal of Computational Biology 7 (3-4). , 2000
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[31]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918985
Sequence Database Search Using Jumping Alignments
Spang, Rainer, Sequence Database Search Using Jumping Alignments. Proc. of ISMB 2000 (). , 2000
PUB | PubMed | Europe PMC
 
[30]
2000 | Report | PUB-ID: 1970490
Affix Trees
Stoye, Jens, Affix Trees. (). Technische Fakultät der Universität Bielefeld, 2000
PUB | PDF
 
[29]
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773341
An iterative method for faster sum-of-pairs multiple sequence alignment
Reinert, Knut, An iterative method for faster sum-of-pairs multiple sequence alignment. Bioinformatics 16 (9). , 2000
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[28]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918988
Computation and Visualization of Degenerate Repeats in Complete Genomes
Kurtz, Stefan, Computation and Visualization of Degenerate Repeats in Complete Genomes. Proc. of ISMB 2000 (). , 2000
PUB | PubMed | Europe PMC
 
[27]
2000 | Konferenzband | Veröffentlicht | PUB-ID: 1918813
Proceedings of the German Conference on Bioinformatics, GCB 2000
Bornberg-Bauer, Erich, Proceedings of the German Conference on Bioinformatics, GCB 2000. (). Berlin, 2000
PUB
 
[26]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1620435
Efficient implementation of lazy suffix trees
Giegerich, Robert, Efficient implementation of lazy suffix trees. Algorithm Engineering. 3rd International Workshop, WAE’99 London, UK, July 19–21, 1999 Proceedings 1668 (). , 1999
PUB | DOI | WoS
 
[25]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918978
Combining Divide-and-Conquer, the A*-Algorithm, and Successive Realignment Approaches to Speed up Multiple Sequence Alignment
Reinert, Knut, Combining Divide-and-Conquer, the A*-Algorithm, and Successive Realignment Approaches to Speed up Multiple Sequence Alignment. Proc. of GCB 1999 (). , 1999
PUB | Download (ext.)
 
[24]
1999 | Report | PUB-ID: 1970495
Consistent Equivalence Relations: A Set-Theoretical Framework for Multiple Sequence Alignment
Morgenstern, Burkhard, Consistent Equivalence Relations: A Set-Theoretical Framework for Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1999
PUB
 
[23]
1999 | Report | PUB-ID: 1970509
Finding Maximal Pairs with Bounded Gap
Brodal, Gerth S., Finding Maximal Pairs with Bounded Gap. (). BRICS, Department of Computer Science, University of Aarhus, 1999
PUB
 
[22]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918971
Finding Maximal Pairs with Bounded Gap
Brodal, Gerth S., Finding Maximal Pairs with Bounded Gap. Proc. of CPM 1999 1645 (). , 1999
PUB | DOI
 
[21]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2488102
The Number of Standard and of Effective Multiple Alignments
Dress, Andreas, The Number of Standard and of Effective Multiple Alignments. Appl. Math. Lett. 11 (4). , 1998
PUB
 
[20]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918538
Die Bedeutung der Zusammenarbeit der Disziplinen in der Anwendung - erläutert anhand von Beispielen
Hildebrand, Martin, Die Bedeutung der Zusammenarbeit der Disziplinen in der Anwendung - erläutert anhand von Beispielen. Der Mathematikunterricht 44 (6). , 1998
PUB
 
[19]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1667771
Multiple sequence alignment with the Divide-and-Conquer method.
Stoye, Jens, Multiple sequence alignment with the Divide-and-Conquer method.. Gene 211 (2). , 1998
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[18]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625402
Rose: generating sequence families
Stoye, Jens, Rose: generating sequence families. BIOINFORMATICS 14 (2). , 1998
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[17]
1998 | Report | PUB-ID: 1970515
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree
Stoye, Jens, Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. (). Department of Computer Science, University of California, Davis, 1998
PUB
 
[16]
1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918964
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)
Stoye, Jens, Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). Proc. of CPM 1998 1448 (). , 1998
PUB | DOI
 
[15]
1998 | Report | PUB-ID: 1970513
Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String
Gusfield, Dan, Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String. (). Department of Computer Science, University of California, Davis, 1998
PUB
 
[14]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2488107
DCA: An efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment
Stoye, Jens, DCA: An efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. CABIOS 13 (6). , 1997
PUB
 
[13]
1997 | Report | PUB-ID: 1970526
On Simultaneous versus Iterative Multiple Sequence Alignment
Perrey, Sören W., On Simultaneous versus Iterative Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1997
PUB
 
[12]
1997 | Report | PUB-ID: 1970517
Rose: Generating Sequence Families
Stoye, Jens, Rose: Generating Sequence Families. (). Technische Fakultät der Universität Bielefeld, 1997
PUB
 
[11]
1997 | Report | PUB-ID: 1970529
Two Applications of the Divide & Conquer Principle in the Molecular Sciences
Brinkmann, Gunnar, Two Applications of the Divide & Conquer Principle in the Molecular Sciences. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1997
PUB
 
[10]
1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1667885
Generating benchmarks for multiple sequence alignments and phylogenetic reconstructions
Stoye, Jens, Generating benchmarks for multiple sequence alignments and phylogenetic reconstructions. Proc. of ISMB 1997 (). , 1997
PUB | PubMed | Europe PMC
 
[9]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773355
Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment
Stoye, Jens, Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment. Applied mathematics letters 10 (2). , 1997
PUB | PDF | DOI | WoS
 
[8]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773358
Two applications of the Divide & Conquer principle in the molecular sciences
Brinkmann, Gunnar, Two applications of the Divide & Conquer principle in the molecular sciences. Mathematical programming 79 (1-3). , 1997
PUB | DOI | WoS
 
[7]
1997 | Report | PUB-ID: 1970523
On the Number of Standard and Effective Multiple Alignments
Dress, Andreas, On the Number of Standard and Effective Multiple Alignments. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1997
PUB
 
[6]
1997 | Report | PUB-ID: 1970520
FDCA: Fast and Accurate Approximation to Sum-of-Pairs Score Optimal Multiple Sequence Alignment
Perrey, Sören W., FDCA: Fast and Accurate Approximation to Sum-of-Pairs Score Optimal Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1997
PUB
 
[5]
1997 | Report | PUB-ID: 1970532
Divide-and-Conquer Multiple Sequence Alignment
Stoye, Jens, Divide-and-Conquer Multiple Sequence Alignment. (). Technische Fakultät der Universität Bielefeld, 1997
PUB
 
[4]
1996 | Report | PUB-ID: 1970533
Fast Approximation to the NP-hard Problem of Multiple Sequence Alignment
Perrey, Sören W., Fast Approximation to the NP-hard Problem of Multiple Sequence Alignment. (). Dept. of Mathematics, Massey University, Palmerston North, New Zealand, 1996
PUB
 
[3]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773351
A general method for fast multiple sequence alignment
Tönges, Udo, A general method for fast multiple sequence alignment. Gene 172 (1). , 1996
PUB | DOI | WoS | PubMed | Europe PMC
 
[2]
1996 | Report | PUB-ID: 1970535
Improving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment
Stoye, Jens, Improving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1996
PUB
 
[1]
1996 | Report | PUB-ID: 1970537
A General Method for Fast Multiple Sequence Alignment
Tönges, Udo, A General Method for Fast Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1996
PUB
 

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: default

Export / Einbettung

201 Publikationen

Alle markieren

[201]
2019 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2932883
A Perspective on Comparative and Functional Genomics
Dörr, Daniel, A Perspective on Comparative and Functional Genomics. Bioinformatics and Phylogenetics 29 (). , 2019
PUB | DOI
 
[200]
2019 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2932884
Whole-genome sequence of the bovine blood fluke Schistosoma bovis supports interspecific hybridization with S. haematobium
Oey, Harald, Whole-genome sequence of the bovine blood fluke Schistosoma bovis supports interspecific hybridization with S. haematobium. PLOS Pathogens 15 (1). , 2019
PUB | DOI | WoS | PubMed | Europe PMC
 
[199]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919005
GraphTeams. A method for discovering spatial gene clusters in Hi-C sequencing data
Schulz, Tizian, GraphTeams. A method for discovering spatial gene clusters in Hi-C sequencing data. BMC Genomics 19 (Suppl. 5). , 2018
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[198]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919006
Computing the family-free DCJ similarity
Rubert, Diego, Computing the family-free DCJ similarity. BMC Bioinformatics 19 (Suppl. 6). , 2018
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[197]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2918481
Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework
Luhmann, Nina, Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework. IEEE/ACM Transactions on Computational Biology and Bioinformatics 15 (6). , 2018
PUB | DOI | WoS | PubMed | Europe PMC
 
[196]
2018 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2930445
Identifying Maximal Perfect Haplotype Blocks
Cunha, Luís, Identifying Maximal Perfect Haplotype Blocks. Proceedings of BSB 2018 11228 (). , 2018
PUB | DOI
 
[195]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2930268
Dynamic Alignment-Free and Reference-Free Read Compression
Holley, Guillaume, Dynamic Alignment-Free and Reference-Free Read Compression. JOURNAL OF COMPUTATIONAL BIOLOGY 25 (7). , 2018
PUB | DOI | WoS | PubMed | Europe PMC
 
[194]
2018 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2913921
Pan-genome Storage and Analysis Techniques
Zekic, Tina, Pan-genome Storage and Analysis Techniques. Comparative Genomics. Methods and Protocols 1704 (). New York, 2018
PUB
 
[193]
2018 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2913922
Family-Free Genome Comparison
Dörr, Daniel, Family-Free Genome Comparison. Comparative Genomics: Methods and Protocols 1704 (). New York, 2018
PUB
 
[192]
2018 | Herausgeber Sammelwerk | Veröffentlicht | PUB-ID: 2913920
Comparative Genomics: Methods and Protocols
Setubal, João C, Comparative Genomics: Methods and Protocols. 1704 (). New York, 2018
PUB
 
[191]
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2919012
Flexible metagenome analysis using the MGX framework
Jaenicke, Sebastian, Flexible metagenome analysis using the MGX framework. Microbiome 6 (). , 2018
PUB | DOI | WoS | PubMed | Europe PMC
 
[190]
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2913556
Bioinformatics for NGS-based metagenomics and the application to biogas research
Jünemann, Sebastian, Bioinformatics for NGS-based metagenomics and the application to biogas research. Journal of Biotechnology 261 (SI). , 2017
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[189]
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2913015
Algorithms for Computing the Family-Free Genomic Similarity under DCJ
Rubert, Diego, Algorithms for Computing the Family-Free Genomic Similarity under DCJ. Comparative Genomics. RECOMB-CG 2017 10562 (). Cham, 2017
PUB | DOI
 
[188]
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909057
Approximating the DCJ distance of balanced genomes in linear time
Rubert, Diego, Approximating the DCJ distance of balanced genomes in linear time. Algorithms for Molecular Biology 12 (). , 2017
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[187]
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2909409
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings
Cunha, Luis, Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. Proceedings of CPM 2017 78 (). , 2017
PUB | DOI
 
[186]
2017 | Preprint | Veröffentlicht | PUB-ID: 2908521
Faster Jumbled Indexing for Binary Run-Length Encoded Strings
Cunha, Luís, Faster Jumbled Indexing for Binary Run-Length Encoded Strings. arXiv: 1702.01280 (). , 2017
PUB
 
[185]
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2907587
Dynamic Alignment-Free and Reference-Free Read Compression
Holley, Guillaume, Dynamic Alignment-Free and Reference-Free Read Compression. Proceedings of RECOMB 2017 10229 (). , 2017
PUB | DOI
 
[184]
2017 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2913016
Finding Teams in Graphs and its Application to Spatial Gene Cluster Discovery
Schulz, Tizian, Finding Teams in Graphs and its Application to Spatial Gene Cluster Discovery. Proceedings of RECOMB-CG 2017 1704 (). Berlin, 2017
PUB | DOI
 
[183]
2017 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909967
New Genome Similarity Measures based on Conserved Gene Adjacencies
Dörr, Daniel, New Genome Similarity Measures based on Conserved Gene Adjacencies. Journal of Computational Biology 24 (6). , 2017
PUB | DOI | WoS | PubMed | Europe PMC
 
[182]
2016 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2905930
Finding approximate gene clusters with GECKO 3
Winter, Sascha, Finding approximate gene clusters with GECKO 3. Nucleic Acids Research 44 (20). , 2016
PUB | DOI | WoS | PubMed | Europe PMC
 
[181]
2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2903708
A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates
Rubert, Diego, A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. Algorithms in Bioinformatics. WABI 2016 9838 (). Cham, 2016
PUB | DOI
 
[180]
2016 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2900129
Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage
Holley, Guillaume, Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage. Algorithms for Molecular Biology 11 (). , 2016
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[179]
2016 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2900421
Identification of the CIMP-like subtype and aberrant methylation of members of the chromosomal segregation and spindle assembly pathways in esophageal adenocarcinoma
Krause, Lutz, Identification of the CIMP-like subtype and aberrant methylation of members of the chromosomal segregation and spindle assembly pathways in esophageal adenocarcinoma. Carcinogenesis 37 (4). , 2016
PUB | DOI | WoS | PubMed | Europe PMC
 
[178]
2016 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2900111
New Genome Similarity Measures based on Conserved Gene Adjacencies
Kowada, Luis Antonio B., New Genome Similarity Measures based on Conserved Gene Adjacencies. Research in Computational Molecular Biology. RECOMB 2016 9649 (). , 2016
PUB | DOI
 
[177]
2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2677844
Sorting linear genomes with rearrangements and indels
Dias Vieira Braga, Marília, Sorting linear genomes with rearrangements and indels. IEEE/ACM Transactions on Computational Biology and Bioinformatics 12 (3). , 2015
PUB | DOI | WoS | PubMed | Europe PMC
 
[176]
2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2726366
On the family-free DCJ distance and similarity
Viduani Martinez, Fábio Henrique, On the family-free DCJ distance and similarity. Algorithms for Molecular Biology 10 (). , 2015
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[175]
2015 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2757497
Bloom Filter Trie - a data structure for pan-genome storage
Holley, Guillaume, Bloom Filter Trie - a data structure for pan-genome storage. Proceedings of WABI 2015 9289 (). , 2015
PUB
 
[174]
2015 | Konferenzband | Veröffentlicht | PUB-ID: 2780229
Proceedings of the 13th Annual Research in Computational Molecular Biology (RECOMB) Satellite Workshop on Comparative Genomics: Bioinformatics
Meidanis, Joao, Proceedings of the 13th Annual Research in Computational Molecular Biology (RECOMB) Satellite Workshop on Comparative Genomics: Bioinformatics. 16 (Supplement 14). , 2015
PUB | Download (ext.)
 
[173]
2015 | Konferenzband | Veröffentlicht | PUB-ID: 2780232
Proceedings of the 13th Annual Research in Computational Molecular Biology (RECOMB) Satellite Workshop on Comparative Genomics: Genomics
Meidanis, Joao, Proceedings of the 13th Annual Research in Computational Molecular Biology (RECOMB) Satellite Workshop on Comparative Genomics: Genomics. 16 (Supplement 10). , 2015
PUB | Download (ext.)
 
[172]
2014 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2684241
On the family-free DCJ distance
Viduani Martinez, Fábio Henrique, On the family-free DCJ distance. Algorithms in Bioinformatics. WABI 2014 8701 (). Berlin ; Heidelberg, 2014
PUB | DOI
 
[171]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2687033
Identifying Gene Clusters by Discovering Common Intervals in Indeterminate Strings
Dörr, Daniel, Identifying Gene Clusters by Discovering Common Intervals in Indeterminate Strings. BMC Genomics 15 (Suppl. 6: Proc. of RECOMB-CG 2014). , 2014
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[170]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2685362
Orthology Detection Combining Clustering and Synteny for Very Large Datasets
Lechner, Marcus, Orthology Detection Combining Clustering and Synteny for Very Large Datasets. PLoS ONE 9 (8). , 2014
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[169]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2689773
GABenchToB: A Genome Assembly Benchmark Tuned on Bacteria and Benchtop Sequencers
Jünemann, Sebastian, GABenchToB: A Genome Assembly Benchmark Tuned on Bacteria and Benchtop Sequencers. PLOS ONE 9 (9). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[168]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2674387
ReadXplorer - Visualization and Analysis of Mapped Sequences
Hilker, Rolf, ReadXplorer - Visualization and Analysis of Mapped Sequences. Bioinformatics 30 (16). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[167]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2665038
Improving the genome annotation of the acarbose producer Actinoplanes sp. SE50/110 by sequencing enriched 5'-ends of primary transcripts
Schwientek, Patrick, Improving the genome annotation of the acarbose producer Actinoplanes sp. SE50/110 by sequencing enriched 5'-ends of primary transcripts. Journal of Biotechnology 190 (). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[166]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2685988
Discovery of transcription start sites in the Chinese hamster genome by next-generation RNA sequencing
Jakobi, Tobias, Discovery of transcription start sites in the Chinese hamster genome by next-generation RNA sequencing. Journal of Biotechnology 190 (). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[165]
2014 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2690122
Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework
Luhmann, Nina, Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework. Proc. of BSB 2014 8826 (). , 2014
PUB | DOI
 
[164]
2014 | Lexikoneintrag | Veröffentlicht | PUB-ID: 2693552
Suffix Tree Construction
Stoye, Jens, Suffix Tree Construction. Encyclopedia of Algorithms (). , 2014
PUB | DOI
 
[163]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2643941
BiPACE 2D – Graph-based multiple alignment for comprehensive two-dimensional gas chromatography–mass spectrometry
Hoffmann, Nils, BiPACE 2D – Graph-based multiple alignment for comprehensive two-dimensional gas chromatography–mass spectrometry. Bioinformatics 30 (7). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[162]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2693409
Metatranskriptomik der Mikrobiota aus der menschlichen Achselhöhle
Fredrich, Eugenie, Metatranskriptomik der Mikrobiota aus der menschlichen Achselhöhle. BIOspektrum 20 (5). , 2014
PUB | DOI
 
[161]
2014 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2665333
Mycoplasma salivarium as a Dominant Coloniser of Fanconi Anaemia Associated Oral Carcinoma
Henrich, Birgit, Mycoplasma salivarium as a Dominant Coloniser of Fanconi Anaemia Associated Oral Carcinoma. PLoS ONE 9 (3). , 2014
PUB | DOI | WoS | PubMed | Europe PMC
 
[160]
2013 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2611641
Restricted DCJ-Indel Model Revisited
Dias Vieira Braga, Marília, Restricted DCJ-Indel Model Revisited. Advances in Bioinformatics and Computational Biology. BSB 2013 8213 (). Cham, 2013
PUB | DOI
 
[159]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2611630
On the Inversion-Indel Distance
Willing, Eyla, On the Inversion-Indel Distance. BMC Bioinformatics 14 (Suppl 15: Proc. of RECOMB-CG 2013). , 2013
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[158]
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2611648
The Potential of Family-Free Genome Comparison
Dias Vieira Braga, Marília, The Potential of Family-Free Genome Comparison. Models and Algorithms for Genome Evolution 19 (). , 2013
PUB | DOI
 
[157]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2575011
metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences
Ander, Christina, metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences. BMC Bioinformatics 14 (Suppl 5: Proc. of RECOMB-Seq 2013). , 2013
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[156]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2641228
Corrigendum: Updating benchtop sequencing performance comparison
Jünemann, Sebastian, Corrigendum: Updating benchtop sequencing performance comparison. Nature biotechnology 31 (12). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[155]
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2611643
The Genesis of the DCJ Formula
Bergeron, Anne, The Genesis of the DCJ Formula. Models and Algorithms for Genome Evolution 19 (). , 2013
PUB | DOI
 
[154]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2575361
Next-generation-sequencing-spectratyping reveals public T-cell receptor repertoires in pediatric very severe aplastic anemia and identifies a beta chain CDR3 sequence associated with hepatitis-induced pathogenesis
Krell, Pina, Next-generation-sequencing-spectratyping reveals public T-cell receptor repertoires in pediatric very severe aplastic anemia and identifies a beta chain CDR3 sequence associated with hepatitis-induced pathogenesis. Haematologica 98 (9). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[153]
2013 | Lexikoneintrag | Veröffentlicht | PUB-ID: 2577323
Taxonomic classification of metagenomic shotgun sequences with CARMA3
Gerlach, Wolfgang, Taxonomic classification of metagenomic shotgun sequences with CARMA3. Encyclopedia of Metagenomics (). , 2013
PUB | DOI
 
[152]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2566922
Updating benchtop sequencing performance comparison
Jünemann, Sebastian, Updating benchtop sequencing performance comparison. Nature Biotechnology 31 (4). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[151]
2013 | Konferenzband | Veröffentlicht | PUB-ID: 2616537
Algorithms in Bioinformatics
Darling, Aaron, Algorithms in Bioinformatics. 8126 (). Heidelberg, 2013
PUB | DOI
 
[150]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2611633
Statistics for approximate gene clusters
Jahn, Katharina, Statistics for approximate gene clusters. BMC Bioinformatics 14 (Suppl 15: Proc. of RECOMB-CG 2013). , 2013
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[149]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2548236
Comparative RNA-sequencing of the acarbose producer Actinoplanes sp. SE50/110 cultivated in different growth media
Schwientek, Patrick, Comparative RNA-sequencing of the acarbose producer Actinoplanes sp. SE50/110 cultivated in different growth media. Journal of Biotechnology 167 (2). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[148]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2529202
MetaSAMS - A novel software platform for taxonomic classification, functional annotation and comparative analysis of metagenome datasets
Zakrzewski, Martha, MetaSAMS - A novel software platform for taxonomic classification, functional annotation and comparative analysis of metagenome datasets. Journal of Biotechnology 167 (2). , 2013
PUB | DOI | WoS | PubMed | Europe PMC
 
[147]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2512642
Gene family assignment-free comparative genomics
Dörr, Daniel, Gene family assignment-free comparative genomics. BMC Bioinformatics 13 (Suppl 19: Proc. of RECOMB-CG 2012). , 2012
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[146]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2517239
Combining peak- and chromatogram-based retention time alignment algorithms for multiple chromatography-mass spectrometry datasets
Hoffmann, Nils, Combining peak- and chromatogram-based retention time alignment algorithms for multiple chromatography-mass spectrometry datasets. BMC Bioinformatics 13 (1). , 2012
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[145]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2512644
Multiple genome comparison based on overlap regions of pairwise local alignments
Jahn, Katharina, Multiple genome comparison based on overlap regions of pairwise local alignments. BMC Bioinformatics 13 (Suppl. 19: Proc. of RECOMB-CG 2012). , 2012
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[144]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2486060
The complete genome sequence of the acarbose producer Actinoplanes sp. SE50/110
Schwientek, Patrick, The complete genome sequence of the acarbose producer Actinoplanes sp. SE50/110. BMC Genomics 13 (1). , 2012
PUB | PDF | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[143]
2012 | Konferenzband | Veröffentlicht | PUB-ID: 2510416
Combinatorial Pattern Matching
Kärkkäinen, Juha, Combinatorial Pattern Matching. 7354 (). Heidelberg, 2012
PUB | DOI
 
[142]
2012 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2468382
Generic Software Frameworks for GC-MS Based Metabolomics
Hoffmann, Nils, Generic Software Frameworks for GC-MS Based Metabolomics. Metabolomics (). , 2012
PUB | PDF | DOI | Download (ext.)
 
[141]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2510984
UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ
Hilker, Rolf, UniMoG - A unifying framework for genomic distance calculation and sorting based on DCJ. Bioinformatics 28 (19). , 2012
PUB | DOI | WoS | PubMed | Europe PMC
 
[140]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2517230
Bacterial Community Shift in Treated Periodontitis Patients Revealed by Ion Torrent 16S rRNA Gene Amplicon Sequencing
Jünemann, Sebastian, Bacterial Community Shift in Treated Periodontitis Patients Revealed by Ion Torrent 16S rRNA Gene Amplicon Sequencing. PLoS ONE 7 (8). , 2012
PUB | DOI | WoS | PubMed | Europe PMC
 
[139]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2396558
On the weight of indels in genomic distances
Dias Vieira Braga, Marília, On the weight of indels in genomic distances. BMC Bioinformatics 12 (Suppl 9: RECOMB-CG 2011). , 2011
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[138]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2396509
Genomic distance under gene substitutions
Dias Vieira Braga, Marília, Genomic distance under gene substitutions. BMC Bioinformatics 12 (Suppl 9: Proc. of RECOMB-CG 2011). , 2011
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[137]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091794
Double Cut and Join with Insertions and Deletions
Dias Vieira Braga, Marília, Double Cut and Join with Insertions and Deletions. Journal of Computational Biology 18 (9). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[136]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091790
Restricted DCJ Model. Rearrangement Problems with Chromosome Reincorporation
Kovac, Jakub, Restricted DCJ Model. Rearrangement Problems with Chromosome Reincorporation. Journal of Computational Biology 18 (9). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[135]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2354746
Sequencing of high G + C microbial genomes using the ultrafast pyrosequencing technology
Schwientek, Patrick, Sequencing of high G + C microbial genomes using the ultrafast pyrosequencing technology. Journal of Biotechnology 155 (1). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[134]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2289952
Exact and complete short-read alignment to microbial genomes using Graphics Processing Unit programming
Blom, Jochen, Exact and complete short-read alignment to microbial genomes using Graphics Processing Unit programming. Bioinformatics 27 (10). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[133]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918550
Common Intervals of Multiple Permutations
Heber, Steffen, Common Intervals of Multiple Permutations. Algorithmica 60 (2). , 2011
PUB | DOI | WoS
 
[132]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2298170
Taxonomic classification of metagenomic shotgun sequences with CARMA3.
Gerlach, Wolfgang, Taxonomic classification of metagenomic shotgun sequences with CARMA3.. Nucleic Acids Res 39 (14). , 2011
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[131]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1897974
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
Erdős, Péter L., Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. Applied Mathematics Letters 24 (1). , 2011
PUB | DOI | WoS
 
[130]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091787
Consistency of Sequence-Based Gene Clusters
Wittler, Roland, Consistency of Sequence-Based Gene Clusters. Journal of Computational Biology 18 (9). , 2011
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[129]
2011 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2091779
Swiftly Computing Center Strings
Hufsky, Franziska, Swiftly Computing Center Strings. BMC Bioinformatics 12 (1). , 2011
PUB | DOI | WoS | PubMed | Europe PMC
 
[128]
2010 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 2445157
Computing the Genomic Distance in Linear Time
Bergeron, Anne, Computing the Genomic Distance in Linear Time. Dagstuhl Seminar Proceedings: 10231 Abstracts Collection : Structure Discovery in Biology: Motifs, Networks & Phylogenies 10231 (). Dagstuhl, 2010
PUB | Download (ext.)
 
[127]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1893893
Phylogenetic Comparative Assembly
Husemann, Peter, Phylogenetic Comparative Assembly. Algorithms for Molecular Biology 5 (1). , 2010
PUB | PDF | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[126]
2010 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918836
Indexing and Searching a Mass Spectrometry Database
Besenbacher, Søren, Indexing and Searching a Mass Spectrometry Database. Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday 6060 (). , 2010
PUB | DOI
 
[125]
2010 | Report | Veröffentlicht | PUB-ID: 1966434
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
Erdős, Péter L., Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. (). , 2010
PUB | arXiv
 
[124]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1966439
The complete genome sequence of Corynebacterium pseudotuberculosis FRC41 isolated from a 12-year-old girl with necrotizing lymphadenitis reveals insights into gene-regulatory networks contributing to virulence
Trost, Eva, The complete genome sequence of Corynebacterium pseudotuberculosis FRC41 isolated from a 12-year-old girl with necrotizing lymphadenitis reveals insights into gene-regulatory networks contributing to virulence. BMC Genomics 11 (1). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[123]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1795670
Partitioning Biological Data with Transitivity Clustering
Wittkop, Tobias, Partitioning Biological Data with Transitivity Clustering. Nature Methods 7 (6). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[122]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898012
Finding Nested Common Intervals Efficiently
Blin, Guillaume, Finding Nested Common Intervals Efficiently. Journal of Computational Biology 17 (9). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[121]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919217
Consistency of Sequence-based Gene Clusters
Wittler, Roland, Consistency of Sequence-based Gene Clusters. Proc. of Recomb-CG 2010 6398 (). , 2010
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[120]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1893890
Repeat-aware Comparative Genome Assembly
Husemann, Peter, Repeat-aware Comparative Genome Assembly. Proc. of GCB 2010 P-173 (). , 2010
PUB | Download (ext.)
 
[119]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1588556
r2cat: Synteny Plots and Comparative Assembly
Husemann, Peter, r2cat: Synteny Plots and Comparative Assembly. Bioinformatics 26 (4). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[118]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1897997
Rearrangement Models and Single-Cut Operations
Bergeron, Anne, Rearrangement Models and Single-Cut Operations. Journal of Computational Biology 17 (9). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[117]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919211
Swiftly Computing Center Strings
Hufsky, Franziska, Swiftly Computing Center Strings. Proc. of WABI 2010 6293 (). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[116]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919216
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving
Kovac, Jakub, The Problem of Chromosome Reincorporation in DCJ Sorting and Halving. Proc. of Recomb-CG 2010 6398 (). , 2010
PUB | DOI
 
[115]
2010 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898025
The Solution Space of Sorting by DCJ
Dias Vieira Braga, Marília, The Solution Space of Sorting by DCJ. Journal of Computational Biology 17 (9). , 2010
PUB | DOI | WoS | PubMed | Europe PMC
 
[114]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919215
Genomic Distance with DCJ and Indels
Dias Vieira Braga, Marília, Genomic Distance with DCJ and Indels. Proc. of WABI 2010 6293 (). , 2010
PUB | DOI
 
[113]
2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919206
Counting All DCJ Sorting Scenarios
Dias Vieira Braga, Marília, Counting All DCJ Sorting Scenarios. Proc. of Recomb-CG 2009 5817 (). , 2009
PUB | DOI
 
[112]
2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919207
Finding Nested Common Intervals Efficiently
Blin, Guillaume, Finding Nested Common Intervals Efficiently. Proc. of Recomb-CG 2009 5817 (). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[111]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898137
Approximative Gencluster und ihre Anwendung in der komparativen Genomik
Jahn, Katharina, Approximative Gencluster und ihre Anwendung in der komparativen Genomik. Informatik-Spektrum 32 (4). , 2009
PUB | DOI
 
[110]
2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1893884
Phylogenetic Comparative Assembly
Husemann, Peter, Phylogenetic Comparative Assembly. Proc. of WABI 2009 5724 (). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[109]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1591507
A Unified Approach for Reconstructing Ancient Gene Clusters
Stoye, Jens, A Unified Approach for Reconstructing Ancient Gene Clusters. IEEE/ACM Transactions on Computational Biology and Bioinformatics 6 (3). , 2009
PUB | DOI | Download (ext.) | WoS | PubMed | Europe PMC
 
[108]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1589098
WebCARMA: a web application for the functional and taxonomic classification of unassembled metagenomic reads
Gerlach, Wolfgang, WebCARMA: a web application for the functional and taxonomic classification of unassembled metagenomic reads. BMC Bioinformatics 10 (1). , 2009
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[107]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1589663
A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance
Bergeron, Anne, A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. Theoretical Computer Science 410 (51). , 2009
PUB | DOI | WoS
 
[106]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1590204
A report on the 2009 SIG on short read sequencing and algorithms (Short-SIG)
Brudno, Michael, A report on the 2009 SIG on short read sequencing and algorithms (Short-SIG). BIOINFORMATICS 25 (21). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[105]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1898105
Computation of Median Gene Clusters
Böcker, Sebastian, Computation of Median Gene Clusters. Journal of Computational Biology 16 (8). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[104]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1591319
ChromA: signal-based retention time alignment for chromatography-mass spectrometry data
Hoffmann, Nils, ChromA: signal-based retention time alignment for chromatography-mass spectrometry data. Bioinformatics 25 (16). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[103]
2009 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919209
Rearrangement Models and Single-Cut Operations
Medvedev, Paul, Rearrangement Models and Single-Cut Operations. Comparative Genomics : International Workshop, RECOMB-CG 2009, Budapest, Hungary, September 27-29, 2009. Proceedings 5817 (). Berlin, Heidelberg, 2009
PUB | DOI
 
[102]
2009 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 1918945
Computational Short Read Metagenomics
Stoye, Jens, Computational Short Read Metagenomics. (). , 2009
PUB
 
[101]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634447
The Sequence Analysis and Management System - SAMS-2.0: Data management and sequence analysis adapted to changing requirements from traditional sanger sequencing to ultrafast sequencing technologies
Bekel, Thomas, The Sequence Analysis and Management System - SAMS-2.0: Data management and sequence analysis adapted to changing requirements from traditional sanger sequencing to ultrafast sequencing technologies. Journal of Biotechnology 140 (1-2). , 2009
PUB | DOI | WoS | PubMed | Europe PMC
 
[100]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919198
Detecting Repeat Families in Incompletely Sequenced Genomes
Quitzau, José Augusto Amgarten, Detecting Repeat Families in Incompletely Sequenced Genomes. Proc. of WABI 2008 5251 (). , 2008
PUB | DOI
 
[99]
2008 | Report | PUB-ID: 1970459
A space efficient representation for sparse de Bruijn subgraphs
Quitzau, José Augusto Amgarten, A space efficient representation for sparse de Bruijn subgraphs. (). Bielefeld, 2008
PUB | PDF
 
[98]
2008 | Report | PUB-ID: 1970461
Online Abelian Pattern Matching
Ejaz, Tahir, Online Abelian Pattern Matching. (). Bielefeld, 2008
PUB | PDF
 
[97]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636699
MeltDB: a software platform for the analysis and integration of metabolomics experiment data
Neuweger, Heiko, MeltDB: a software platform for the analysis and integration of metabolomics experiment data. Bioinformatics 24 (23). , 2008
PUB | DOI | WoS | PubMed | Europe PMC
 
[96]
2008 | Lexikoneintrag | Veröffentlicht | PUB-ID: 1918834
Suffix Tree Construction in RAM (1997; Farach-Colton)
Stoye, Jens, Suffix Tree Construction in RAM (1997; Farach-Colton). Encyclopedia of Algorithms (). , 2008
PUB | DOI
 
[95]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919192
Computation of Median Gene Clusters
Böcker, Sebastian, Computation of Median Gene Clusters. Proc. of RECOMB 2008 4955 (). , 2008
PUB | DOI
 
[94]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919200
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
Bergeron, Anne, On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios. Proc. of Recomb-CG 2008 5267 (). , 2008
PUB | DOI
 
[93]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587078
Counting suffix arrays and strings
Schürmann, Klaus-Bernd, Counting suffix arrays and strings. THEORETICAL COMPUTER SCIENCE 395 (2-3). , 2008
PUB | DOI | WoS
 
[92]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1586009
Taxonomic composition and gene content of a methane-producing microbial community isolated from a biogas reactor
Krause, Lutz, Taxonomic composition and gene content of a methane-producing microbial community isolated from a biogas reactor. JOURNAL OF BIOTECHNOLOGY 136 (1-2). , 2008
PUB | DOI | WoS | PubMed | Europe PMC
 
[91]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1586785
Comparative Pathway Analyzer - a web server for comparative analysis, clustering and visualization of metabolic networks in multiple organisms
Oehm, Sebastian, Comparative Pathway Analyzer - a web server for comparative analysis, clustering and visualization of metabolic networks in multiple organisms. NUCLEIC ACIDS RESEARCH 36 (Web Server). , 2008
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[90]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1783364
Phylogenetic classification of short environmental DNA fragments
Krause, Lutz, Phylogenetic classification of short environmental DNA fragments. Nucleic Acids Research 36 (7). , 2008
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[89]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919195
HP Distance via Double Cut and Join Distance
Bergeron, Anne, HP Distance via Double Cut and Join Distance. Combinatorial Pattern Matching. 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008 Proceedings (). , 2008
PUB | DOI
 
[88]
2007 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918828
Chapter 12: Gecko and GhostFam - Rigorous and Efficient Gene Cluster Detection in Prokaryotic Genomes
Schmidt, Thomas, Chapter 12: Gecko and GhostFam - Rigorous and Efficient Gene Cluster Detection in Prokaryotic Genomes. Comparative Genomics, Volume 2 396 (). Totowa, NJ, 2007
PUB | DOI | PubMed | Europe PMC
 
[87]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918432
Character Sets of Strings
Didier, Gilles, Character Sets of Strings. Journal of Discrete Algorithms 5 (2). , 2007
PUB | DOI
 
[86]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1595253
An incomplex algorithm for fast suffix array construction
Schürmann, Klaus-Bernd, An incomplex algorithm for fast suffix array construction. SOFTWARE-PRACTICE & EXPERIENCE 37 (3). , 2007
PUB | DOI | WoS
 
[85]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1783345
GISMO - gene identification using a support vector machine for ORF classification
Krause, Lutz, GISMO - gene identification using a support vector machine for ORF classification. Nucleic Acids Research 35 (2). , 2007
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[84]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1630781
Based Upon Repeat Pattern (BURP): an algorithm to characterize the long-term evolution of Staphylococcus aureus populations based on spa polymorphisms
Mellmann, Alexander, Based Upon Repeat Pattern (BURP): an algorithm to characterize the long-term evolution of Staphylococcus aureus populations based on spa polymorphisms. BMC MICROBIOLOGY 7 (1). , 2007
PUB | DOI | WoS | PubMed | Europe PMC
 
[83]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599943
Panta rhei (QAlign2): an open graphical environment for sequence analysis
Sammeth, Michael, Panta rhei (QAlign2): an open graphical environment for sequence analysis. BIOINFORMATICS 22 (7). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[82]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599570
Efficient q-gram filters for finding all epsilon-matches over a given length
Rasmussen, Kim R., Efficient q-gram filters for finding all epsilon-matches over a given length. JOURNAL OF COMPUTATIONAL BIOLOGY 13 (2). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[81]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599574
On sorting by translocations
Bergeron, Anne, On sorting by translocations. JOURNAL OF COMPUTATIONAL BIOLOGY 13 (2). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[80]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597213
Comparing tandem repeats with duplications and excisions of variable degree
Sammeth, Michael, Comparing tandem repeats with duplications and excisions of variable degree. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3 (4). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[79]
2006 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1596811
A Unifying View of Genome Rearrangements
Bergeron, Anne, A Unifying View of Genome Rearrangements. Proc. of WABI 2006 4175 (). , 2006
PUB | DOI | WoS
 
[78]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597313
On the similarity of sets of permutations and its applications to genome comparison
Bergeron, Anne, On the similarity of sets of permutations and its applications to genome comparison. JOURNAL OF COMPUTATIONAL BIOLOGY 13 (7). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[77]
2006 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 1918946
Index Structures in Biological Sequence Analysis: From Simplicity to Complexity and Back
Stoye, Jens, Index Structures in Biological Sequence Analysis: From Simplicity to Complexity and Back. (). , 2006
PUB
 
[76]
2006 | Report | PUB-ID: 1970464
On Common Intervals with Errors
Chauve, Cedric, On Common Intervals with Errors. (). Bielefeld, 2006
PUB | PDF
 
[75]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1631957
Finding novel genes in bacterial communities isolated from the environment
Krause, Lutz, Finding novel genes in bacterial communities isolated from the environment. BIOINFORMATICS 22 (14). , 2006
PUB | DOI | WoS | PubMed | Europe PMC
 
[74]
2005 | Report | PUB-ID: 1970470
Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI)
Sammeth, Michael, Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI). (). Bielefeld, 2005
PUB | PDF | DOI
 
[73]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919012
An Incomplex Algorithm for Fast Suffix Array Construction
Schürmann, Klaus-Bernd, An Incomplex Algorithm for Fast Suffix Array Construction. Proc. of ALENEX/ANALCO 2005 (). , 2005
PUB
 
[72]
2005 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918824
Chapter 10: The Inversion Distance Problem
Bergeron, Anne, Chapter 10: The Inversion Distance Problem. Mathematics of Evolution and Phylogeny (). , 2005
PUB
 
[71]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1603220
On Sorting by Translocations
Bergeron, Anne, On Sorting by Translocations. Proc. of RECOMB 2005 3500 (). , 2005
PUB | DOI | WoS
 
[70]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775168
Large scale hierarchical clustering of protein sequences
Krause, Antje, Large scale hierarchical clustering of protein sequences. BMC Bioinformatics 6 (1). , 2005
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[69]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773302
BACCardI - a tool for the validation of genomic assemblies, assisting genome finishing and intergenome comparison
Bartels, Daniela, BACCardI - a tool for the validation of genomic assemblies, assisting genome finishing and intergenome comparison. Bioinformatics 21 (7). , 2005
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[68]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918947
Informatische Methoden zur Protein-Identifikation
Böcker, Sebastian, Informatische Methoden zur Protein-Identifikation. LaborPraxis 29 (10). , 2005
PUB
 
[67]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1601348
Protein Annotation by Secondary Structure Based Alignments (PASSTA)
Bannert, Constantin, Protein Annotation by Secondary Structure Based Alignments (PASSTA). Proc. of CompLife 2005 3695 (). , 2005
PUB | DOI | WoS
 
[66]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1601361
Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI)
Sammeth, Michael, Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI). Proc. of WABI 2005 3692 (). , 2005
PUB | DOI | WoS
 
[65]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1603216
Efficient q-Gram Filters for Finding All ε-Matches Over a Given Length
Rasmussen, Kim R., Efficient q-Gram Filters for Finding All ε-Matches Over a Given Length. Proc. of RECOMB 2005 3500 (). , 2005
PUB | DOI | WoS
 
[64]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919026
Counting Suffix Arrays and Strings
Schürmann, Klaus-Bernd, Counting Suffix Arrays and Strings. Proc. of SPIRE 2005 3772 (). , 2005
PUB | DOI
 
[63]
2005 | Report | PUB-ID: 1970472
Counting Suffix Arrays and Strings
Schürmann, Klaus-Bernd, Counting Suffix Arrays and Strings. (). Bielefeld, 2005
PUB | PDF
 
[62]
2004 | Konferenzband | Veröffentlicht | PUB-ID: 1918823
Proceedings of the German Conference on Bioinformatics, GCB 2004
Giegerich, Robert, Proceedings of the German Conference on Bioinformatics, GCB 2004. P-53 (). Bonn, 2004
PUB
 
[61]
2004 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1607260
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
Schmidt, Thomas, Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences. Proc. of CPM 2004 3109 (). , 2004
PUB | DOI | WoS
 
[60]
2004 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1606286
Suboptimal Local Alignments across Multiple Scoring Schemes
Michael, Morris, Suboptimal Local Alignments across Multiple Scoring Schemes. Proc. of WABI 2004 3240 (). , 2004
PUB | DOI | WoS
 
[59]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773554
Correction: Benchmarking tools for the alignment of functional noncoding DNA
Pollard, Daniel A., Correction: Benchmarking tools for the alignment of functional noncoding DNA. BMC Bioinformatics 5 (1). , 2004
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[58]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773560
Algorithmic complexity of protein identification: combinatorics of weighted strings
Cieliebak, Mark, Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics 137 (1). , 2004
PUB | PDF | DOI | WoS
 
[57]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773312
Benchmarking tools for the alignment of functional noncoding DNA
Pollard, Daniel A., Benchmarking tools for the alignment of functional noncoding DNA. BMC Bioinformatics 5 (1). , 2004
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[56]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773569
Linear time algorithms for finding and representing all the tandem repeats in a string
Gusfield, Dan, Linear time algorithms for finding and representing all the tandem repeats in a string. Journal of computer and system sciences 69 (4). , 2004
PUB | PDF | DOI | WoS
 
[55]
2004 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1607263
Reversal Distance without Hurdles and Fortresses
Bergeron, Anne, Reversal Distance without Hurdles and Fortresses. Proc. of CPM 2004 3109 (). , 2004
PUB | DOI | WoS
 
[54]
2003 | Report | PUB-ID: 1970475
Suffix Tree Construction and Storage with Limited Main Memory
Schürmann, Klaus-Bernd, Suffix Tree Construction and Storage with Limited Main Memory. (). Bielefeld, 2003
PUB | PDF
 
[53]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1612664
The European Conference on Computational Biology
Heber, Steffen, The European Conference on Computational Biology. Drug Discovery Today 8 (3). , 2003
PUB | DOI | WoS | PubMed | Europe PMC
 
[52]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918949
Finden, fast ohne zu suchen: Indexstrukturen in der Bioinformatik
Giegerich, Robert, Finden, fast ohne zu suchen: Indexstrukturen in der Bioinformatik. Forschung an der Universität Bielefeld 26 (). , 2003
PUB
 
[51]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919005
Evaluation of the Jumping Alignment Algorithm with Artificial and Biological Data
Bannert, Constantin, Evaluation of the Jumping Alignment Algorithm with Artificial and Biological Data. Proc. of GCB 2003 (). , 2003
PUB
 
[50]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1610397
Efficient implementation of lazy suffix trees
Giegerich, Robert, Efficient implementation of lazy suffix trees. SOFTWARE-PRACTICE & EXPERIENCE 33 (11). , 2003
PUB | PDF | DOI | WoS
 
[49]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1609403
Divide-and-conquer multiple alignment with segment-based constraints
Sammeth, Michael, Divide-and-conquer multiple alignment with segment-based constraints. BIOINFORMATICS 19 (Suppl 2). , 2003
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[48]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1610433
On the similarity of sets of permutations and its applications to genome comparison
Bergeron, Anne, On the similarity of sets of permutations and its applications to genome comparison. Proc. of COCOON 2003 2697 (). , 2003
PUB | DOI | WoS
 
[47]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1610503
QAlign: quality-based multiple alignments with dynamic phylogenetic analysis
Sammeth, Michael, QAlign: quality-based multiple alignments with dynamic phylogenetic analysis. BIOINFORMATICS 19 (12). , 2003
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[46]
2003 | Report | PUB-ID: 1970477
On the Similarity of Sets of Permutations and its Applications to Genome Comparison
Bergeron, Anne, On the Similarity of Sets of Permutations and its Applications to Genome Comparison. (). Bielefeld, 2003
PUB | PDF
 
[45]
2002 | Kurzbeitrag Konferenz / Poster | Veröffentlicht | PUB-ID: 1918951
Index Structures for Large Sequence Data: Suffix Trees and Affix Trees
Stoye, Jens, Index Structures for Large Sequence Data: Suffix Trees and Affix Trees. Lecture Notes in Informatics P-20 (Ergänzungsband). , 2002
PUB
 
[44]
2002 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919000
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings
Cieliebak, Marc, Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. Proc. of IFIP TCS 2002 (). , 2002
PUB
 
[43]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773578
A novel approach to remote homology detection: jumping alignments
Spang, Rainer, A novel approach to remote homology detection: jumping alignments. Journal of Computational Biology 9 (5). , 2002
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[42]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773332
Simple and flexible detection of contiguous repeats using a suffix tree
Stoye, Jens, Simple and flexible detection of contiguous repeats using a suffix tree. Theoretical Computer Science 270 (1-2). , 2002
PUB | PDF | DOI | WoS
 
[41]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773329
Common intervals and sorting by reversals: a marriage of necessity
Bergeron, Anne, Common intervals and sorting by reversals: a marriage of necessity. Bioinformatics 18 (Suppl 2). , 2002
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[40]
2002 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918995
Resampling Methods in Physical Mapping
Heber, Steffen, Resampling Methods in Physical Mapping. Proc. of GfKl 2000 (). , 2002
PUB
 
[39]
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773335
REPuter: the manifold applications of repeat analysis on a genomic scale
Kurtz, Stefan, REPuter: the manifold applications of repeat analysis on a genomic scale. Nucleic Acids Research 29 (22). , 2001
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[38]
2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918992
Finding all Common Intervals of k Permutations
Heber, Steffen, Finding all Common Intervals of k Permutations. Proc. of CPM 2001 2089 (). , 2001
PUB | DOI
 
[37]
2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1880197
Algorithms for Finding Gene Clusters
Heber, Steffen, Algorithms for Finding Gene Clusters. Proc. of WABI 2001 2149 (). Berlin, 2001
PUB | DOI
 
[36]
2001 | Report | PUB-ID: 1970479
Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings
Cieliebak, Marc, Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings. (). ETH Zürich, Dept. of Computer Science, 2001
PUB
 
[35]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918981
Contig Selection in Physical Mapping
Heber, Steffen, Contig Selection in Physical Mapping. Proc. of RECOMB 2000 (). , 2000
PUB | DOI | WoS | PubMed | Europe PMC
 
[34]
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1918817
Finding Maximal Pairs with Bounded Gap
Brodal, Gerth S., Finding Maximal Pairs with Bounded Gap. Matching Patterns (Journal of Discrete Algorithms) (). , 2000
PUB
 
[33]
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773345
The SYSTERS protein sequence cluster set
Krause, Antje, The SYSTERS protein sequence cluster set. Nucleic Acids Research 28 (1). , 2000
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[32]
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773572
Contig selection in physical mapping
Heber, Steffen, Contig selection in physical mapping. Journal of Computational Biology 7 (3-4). , 2000
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[31]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918985
Sequence Database Search Using Jumping Alignments
Spang, Rainer, Sequence Database Search Using Jumping Alignments. Proc. of ISMB 2000 (). , 2000
PUB | PubMed | Europe PMC
 
[30]
2000 | Report | PUB-ID: 1970490
Affix Trees
Stoye, Jens, Affix Trees. (). Technische Fakultät der Universität Bielefeld, 2000
PUB | PDF
 
[29]
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773341
An iterative method for faster sum-of-pairs multiple sequence alignment
Reinert, Knut, An iterative method for faster sum-of-pairs multiple sequence alignment. Bioinformatics 16 (9). , 2000
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[28]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918988
Computation and Visualization of Degenerate Repeats in Complete Genomes
Kurtz, Stefan, Computation and Visualization of Degenerate Repeats in Complete Genomes. Proc. of ISMB 2000 (). , 2000
PUB | PubMed | Europe PMC
 
[27]
2000 | Konferenzband | Veröffentlicht | PUB-ID: 1918813
Proceedings of the German Conference on Bioinformatics, GCB 2000
Bornberg-Bauer, Erich, Proceedings of the German Conference on Bioinformatics, GCB 2000. (). Berlin, 2000
PUB
 
[26]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1620435
Efficient implementation of lazy suffix trees
Giegerich, Robert, Efficient implementation of lazy suffix trees. Algorithm Engineering. 3rd International Workshop, WAE’99 London, UK, July 19–21, 1999 Proceedings 1668 (). , 1999
PUB | DOI | WoS
 
[25]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918978
Combining Divide-and-Conquer, the A*-Algorithm, and Successive Realignment Approaches to Speed up Multiple Sequence Alignment
Reinert, Knut, Combining Divide-and-Conquer, the A*-Algorithm, and Successive Realignment Approaches to Speed up Multiple Sequence Alignment. Proc. of GCB 1999 (). , 1999
PUB | Download (ext.)
 
[24]
1999 | Report | PUB-ID: 1970495
Consistent Equivalence Relations: A Set-Theoretical Framework for Multiple Sequence Alignment
Morgenstern, Burkhard, Consistent Equivalence Relations: A Set-Theoretical Framework for Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1999
PUB
 
[23]
1999 | Report | PUB-ID: 1970509
Finding Maximal Pairs with Bounded Gap
Brodal, Gerth S., Finding Maximal Pairs with Bounded Gap. (). BRICS, Department of Computer Science, University of Aarhus, 1999
PUB
 
[22]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918971
Finding Maximal Pairs with Bounded Gap
Brodal, Gerth S., Finding Maximal Pairs with Bounded Gap. Proc. of CPM 1999 1645 (). , 1999
PUB | DOI
 
[21]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2488102
The Number of Standard and of Effective Multiple Alignments
Dress, Andreas, The Number of Standard and of Effective Multiple Alignments. Appl. Math. Lett. 11 (4). , 1998
PUB
 
[20]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1918538
Die Bedeutung der Zusammenarbeit der Disziplinen in der Anwendung - erläutert anhand von Beispielen
Hildebrand, Martin, Die Bedeutung der Zusammenarbeit der Disziplinen in der Anwendung - erläutert anhand von Beispielen. Der Mathematikunterricht 44 (6). , 1998
PUB
 
[19]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1667771
Multiple sequence alignment with the Divide-and-Conquer method.
Stoye, Jens, Multiple sequence alignment with the Divide-and-Conquer method.. Gene 211 (2). , 1998
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[18]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625402
Rose: generating sequence families
Stoye, Jens, Rose: generating sequence families. BIOINFORMATICS 14 (2). , 1998
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
[17]
1998 | Report | PUB-ID: 1970515
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree
Stoye, Jens, Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree. (). Department of Computer Science, University of California, Davis, 1998
PUB
 
[16]
1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1918964
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)
Stoye, Jens, Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). Proc. of CPM 1998 1448 (). , 1998
PUB | DOI
 
[15]
1998 | Report | PUB-ID: 1970513
Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String
Gusfield, Dan, Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String. (). Department of Computer Science, University of California, Davis, 1998
PUB
 
[14]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2488107
DCA: An efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment
Stoye, Jens, DCA: An efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. CABIOS 13 (6). , 1997
PUB
 
[13]
1997 | Report | PUB-ID: 1970526
On Simultaneous versus Iterative Multiple Sequence Alignment
Perrey, Sören W., On Simultaneous versus Iterative Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1997
PUB
 
[12]
1997 | Report | PUB-ID: 1970517
Rose: Generating Sequence Families
Stoye, Jens, Rose: Generating Sequence Families. (). Technische Fakultät der Universität Bielefeld, 1997
PUB
 
[11]
1997 | Report | PUB-ID: 1970529
Two Applications of the Divide & Conquer Principle in the Molecular Sciences
Brinkmann, Gunnar, Two Applications of the Divide & Conquer Principle in the Molecular Sciences. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1997
PUB
 
[10]
1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1667885
Generating benchmarks for multiple sequence alignments and phylogenetic reconstructions
Stoye, Jens, Generating benchmarks for multiple sequence alignments and phylogenetic reconstructions. Proc. of ISMB 1997 (). , 1997
PUB | PubMed | Europe PMC
 
[9]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773355
Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment
Stoye, Jens, Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment. Applied mathematics letters 10 (2). , 1997
PUB | PDF | DOI | WoS
 
[8]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773358
Two applications of the Divide & Conquer principle in the molecular sciences
Brinkmann, Gunnar, Two applications of the Divide & Conquer principle in the molecular sciences. Mathematical programming 79 (1-3). , 1997
PUB | DOI | WoS
 
[7]
1997 | Report | PUB-ID: 1970523
On the Number of Standard and Effective Multiple Alignments
Dress, Andreas, On the Number of Standard and Effective Multiple Alignments. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1997
PUB
 
[6]
1997 | Report | PUB-ID: 1970520
FDCA: Fast and Accurate Approximation to Sum-of-Pairs Score Optimal Multiple Sequence Alignment
Perrey, Sören W., FDCA: Fast and Accurate Approximation to Sum-of-Pairs Score Optimal Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1997
PUB
 
[5]
1997 | Report | PUB-ID: 1970532
Divide-and-Conquer Multiple Sequence Alignment
Stoye, Jens, Divide-and-Conquer Multiple Sequence Alignment. (). Technische Fakultät der Universität Bielefeld, 1997
PUB
 
[4]
1996 | Report | PUB-ID: 1970533
Fast Approximation to the NP-hard Problem of Multiple Sequence Alignment
Perrey, Sören W., Fast Approximation to the NP-hard Problem of Multiple Sequence Alignment. (). Dept. of Mathematics, Massey University, Palmerston North, New Zealand, 1996
PUB
 
[3]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773351
A general method for fast multiple sequence alignment
Tönges, Udo, A general method for fast multiple sequence alignment. Gene 172 (1). , 1996
PUB | DOI | WoS | PubMed | Europe PMC
 
[2]
1996 | Report | PUB-ID: 1970535
Improving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment
Stoye, Jens, Improving the Divide-and-Conquer Approach to Sum-of-Pairs Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1996
PUB
 
[1]
1996 | Report | PUB-ID: 1970537
A General Method for Fast Multiple Sequence Alignment
Tönges, Udo, A General Method for Fast Multiple Sequence Alignment. (). Forschungsschwerpunkt Mathematisierung, Universität Bielefeld, 1996
PUB
 

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: default

Export / Einbettung