Please note that PUB no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

432 Publikationen

2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773761 OA
Accurate and robust phylogeny estimation based on profile distances: a study of the Chlorophyceae (Chlorophyta)
Müller, Tobias, Accurate and robust phylogeny estimation based on profile distances: a study of the Chlorophyceae (Chlorophyta). BMC Evolutionary Biology 4 (1). , 2004
PUB | PDF | DOI | WoS | PubMed | Europe PMC
 
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
 
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2017545 OA
Look & Listen: Sonification and Visualization of Multiparameter Micrographs
Nattkemper, Tim Wilhelm, Look & Listen: Sonification and Visualization of Multiparameter Micrographs. Engineering in Medicine and Biology Society. Proceedings of the 25th Annual International Conference of the IEEE 2 (). Cancun, Mexico, 2003
PUB | PDF
 
2003 | Report | PUB-ID: 1970475 OA
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
 
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
 
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
 
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
 
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1610397 OA
Efficient implementation of lazy suffix trees
Giegerich, Robert, Efficient implementation of lazy suffix trees. SOFTWARE-PRACTICE & EXPERIENCE 33 (11). , 2003
PUB | PDF | DOI | WoS
 
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1609403 OA
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
 
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
 
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1610503 OA
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
 
2003 | Report | PUB-ID: 1970477 OA
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
 
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
 
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
 
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773578 OA
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
 
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773332 OA
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
 
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773329 OA
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
 
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
 
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
 
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
 
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
 
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
 
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
 
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773345 OA
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
 
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1773572 OA
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
 
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
 
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
 
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
 
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
 
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
 
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
 
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
 

Filter und Suchbegriffe

department=66100

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: default

Export / Einbettung