default search action
Jens Stoye
Person information
- affiliation: Bielefeld University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j73]Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye:
Investigating the complexity of the double distance problems. Algorithms Mol. Biol. 19(1): 1 (2024) - [c59]Leonard Bohnenkämper
, Jens Stoye, Daniel Dörr:
Reconstructing Rearrangement Phylogenies of Natural Genomes. WABI 2024: 12:1-12:16 - 2023
- [c58]Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye
On the Class of Double Distance Problems. RECOMB-CG 2023: 35-50 - [i9]Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye:
Investigating the complexity of the double distance problems. CoRR abs/2303.04205 (2023) - 2022
- [j72]Paola Bonizzoni, Matteo Costantini, Clelia de Felice
Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches. Inf. Sci. 607: 458-476 (2022) - [c57]Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, Jens Stoye
A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance. WABI 2022: 13:1-13:16 - [i8]Paola Bonizzoni, Matteo Costantini, Clelia De Felice, Alessia Petescia, Yuri Pirola, Marco Previtali, Raffaella Rizzi, Jens Stoye, Rocco Zaccagnino, Rosalba Zizza:
Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches. CoRR abs/2202.13884 (2022) - 2021
- [j71]Tizian Schulz
Detecting high-scoring local alignments in pangenome graphs. Bioinform. 37(16): 2266-2274 (2021) - [j70]Leonard Bohnenkämper
Computing the Rearrangement Distance of Natural Genomes. J. Comput. Biol. 28(4): 410-431 (2021) - [j69]Linda K. Sundermann
Reconstructing tumor evolutionary histories and clone trees in polynomial-time with SubMARine. PLoS Comput. Biol. 17(1) (2021) - [j68]Eyla Willing, Jens Stoye
Computing the Inversion-Indel Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2314-2326 (2021) - [c56]Paola Bonizzoni
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning. AlCoB 2021: 16-28 - 2020
- [j67]Jarno Alanko
Finding all maximal perfect haplotype blocks in linear time. Algorithms Mol. Biol. 15(1): 2 (2020) - [j66]Diego P. Rubert
Searching and inferring colorful topological motifs in vertex-colored graphs. J. Comb. Optim. 40(2): 379-411 (2020) - [c55]Leonard Bohnenkämper
Computing the Rearrangement Distance of Natural Genomes. RECOMB 2020: 3-18 - [i7]Leonard Bohnenkämper
Computing the rearrangement distance of natural genomes. CoRR abs/2001.02139 (2020) - [i6]Diego P. Rubert
On motifs in colored graphs. CoRR abs/2005.13634 (2020)
2010 – 2019
- 2019
- [c54]Jarno Alanko
Finding All Maximal Perfect Haplotype Blocks in Linear Time. WABI 2019: 8:1-8:9 - [i5]Eyla Willing, Jens Stoye
Computing the Inversion-Indel Distance. CoRR abs/1909.12877 (2019) - [i4]Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Jens Stoye
25 Years of the Burrows-Wheeler Transform (Dagstuhl Seminar 19241). Dagstuhl Reports 9(6): 55-68 (2019) - 2018
- [j65]Diego P. Rubert
Computing the family-free DCJ similarity. BMC Bioinform. 19-S(6): 31-42 (2018) - [j64]Guillaume Holley, Roland Wittler, Jens Stoye
Dynamic Alignment-Free and Reference-Free Read Compression. J. Comput. Biol. 25(7): 825-836 (2018) - [j63]Nina Luhmann, Cédric Chauve, Jens Stoye
Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework. IEEE ACM Trans. Comput. Biol. Bioinform. 15(6): 2094-2100 (2018) - [c53]Luís Felipe I. Cunha
Identifying Maximal Perfect Haplotype Blocks. BSB 2018: 26-37 - 2017
- [j62]Diego P. Rubert
Approximating the DCJ distance of balanced genomes in linear time. Algorithms Mol. Biol. 12(1): 3:1-3:13 (2017) - [j61]Daniel Doerr, Luis Antonio Brasil Kowada, Eloi Araujo, Shachi Deshpande, Simone Dantas, Bernard M. E. Moret, Jens Stoye
New Genome Similarity Measures based on Conserved Gene Adjacencies. J. Comput. Biol. 24(6): 616-634 (2017) - [c52]Luís Felipe I. Cunha, Simone Dantas, Travis Gagie
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. CPM 2017: 19:1-19:9 - [c51]Guillaume Holley, Roland Wittler, Jens Stoye
Dynamic Alignment-Free and Reference-Free Read Compression. RECOMB 2017: 50-65 - [c50]Diego P. Rubert
Algorithms for Computing the Family-Free Genomic Similarity Under DCJ. RECOMB-CG 2017: 76-100 - [c49]Tizian Schulz
Finding Teams in Graphs and Its Application to Spatial Gene Cluster Discovery. RECOMB-CG 2017: 197-212 - [i3]Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Antonio Brasil Kowada, Jens Stoye:
Fast and Simple Jumbled Indexing for Binary RLE Strings. CoRR abs/1702.01280 (2017) - 2016
- [j60]Guillaume Holley, Roland Wittler, Jens Stoye
Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage. Algorithms Mol. Biol. 11: 3 (2016) - [c48]Luis Antonio Brasil Kowada, Daniel Doerr, Simone Dantas, Jens Stoye
New Genome Similarity Measures Based on Conserved Gene Adjacencies. RECOMB 2016: 204-224 - [c47]Diego P. Rubert
A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates. WABI 2016: 293-306 - [r2]Jens Stoye:
Suffix Tree Construction. Encyclopedia of Algorithms 2016: 2144-2149 - 2015
- [j59]Fábio Viduani Martinez
On the family-free DCJ distance and similarity. Algorithms Mol. Biol. 10: 13 (2015) - [j58]Marília D. V. Braga, Jens Stoye
Sorting Linear Genomes with Rearrangements and Indels. IEEE ACM Trans. Comput. Biol. Bioinform. 12(3): 500-506 (2015) - [c46]Guillaume Holley, Roland Wittler, Jens Stoye
Bloom Filter Trie - A Data Structure for Pan-Genome Storage. WABI 2015: 217-230 - 2014
- [j57]Nils Hoffmann
BiPACE 2D - graph-based multiple alignment for comprehensive 2D gas chromatography-mass spectrometry. Bioinform. 30(7): 988-995 (2014) - [j56]Rolf Hilker
ReadXplorer - visualization and analysis of mapped sequences. Bioinform. 30(16): 2247-2254 (2014) - [j55]Jens Stoye, Juha Kärkkäinen:
Editorial. J. Discrete Algorithms 25: 1 (2014) - [c45]Fábio Viduani Martinez
On the Family-Free DCJ Distance. WABI 2014: 174-186 - [c44]Nina Luhmann
Scaffolding of Ancient Contigs and Ancestral Reconstruction in a Phylogenetic Framework. BSB 2014: 135-143 - 2013
- [j54]Katharina Jahn, Sascha Winter
Statistics for approximate gene clusters. BMC Bioinform. 14(S-15): S14 (2013) - [j53]Eyla Willing, Simone Zaccaria
On the inversion-indel distance. BMC Bioinform. 14(S-15): S3 (2013) - [j52]Christina Ander, Ole Schulz-Trieglaff, Jens Stoye
metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences. BMC Bioinform. 14(S-5): S2 (2013) - [c43]Marília D. V. Braga, Jens Stoye
Restricted DCJ-Indel Model Revisited. BSB 2013: 36-46 - [p3]Anne Bergeron, Jens Stoye
The Genesis of the DCJ Formula. Models and Algorithms for Genome Evolution 2013: 63-81 - [p2]Marília D. V. Braga, Cédric Chauve, Daniel Doerr, Katharina Jahn, Jens Stoye
The Potential of Family-Free Genome Comparison. Models and Algorithms for Genome Evolution 2013: 287-307 - [e4]Aaron E. Darling, Jens Stoye
Algorithms in Bioinformatics - 13th International Workshop, WABI 2013, Sophia Antipolis, France, September 2-4, 2013. Proceedings. Lecture Notes in Computer Science 8126, Springer 2013, ISBN 978-3-642-40452-8 [contents] - 2012
- [j51]Rolf Hilker
UniMoG - a unifying framework for genomic distance calculation and sorting based on DCJ. Bioinform. 28(19): 2509-2511 (2012) - [j50]Nils Hoffmann
Combining peak- and chromatogram-based retention time alignment algorithms for multiple chromatography-mass spectrometry datasets. BMC Bioinform. 13: 214 (2012) - [j49]Daniel Doerr, Annelyse Thévenin, Jens Stoye
Gene family assignment-free comparative genomics. BMC Bioinform. 13(S-19): S3 (2012) - [j48]Katharina Jahn, Henner Sudek, Jens Stoye
Multiple genome comparison based on overlap regions of pairwise local alignments. BMC Bioinform. 13(S-19): S7 (2012) - [e3]Juha Kärkkäinen, Jens Stoye
Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings. Lecture Notes in Computer Science 7354, Springer 2012, ISBN 978-3-642-31264-9 [contents] - 2011
- [j47]Steffen Heber
Common Intervals of Multiple Permutations. Algorithmica 60(2): 175-206 (2011) - [j46]Péter L. Erdös, Lajos Soukup, Jens Stoye
Balanced vertices in trees and a simpler algorithm to compute the genomic distance. Appl. Math. Lett. 24(1): 82-86 (2011) - [j45]Jochen Blom, Tobias Jakobi
Exact and complete short-read alignment to microbial genomes using Graphics Processing Unit programming. Bioinform. 27(10): 1351-1358 (2011) - [j44]Franziska Hufsky
Swiftly Computing Center Strings. BMC Bioinform. 12: 106 (2011) - [j43]Marília D. V. Braga, Raphael Machado, Leonardo Costa Ribeiro
On the weight of indels in genomic distances. BMC Bioinform. 12(S-9): S13 (2011) - [j42]Marília D. V. Braga, Raphael Machado, Leonardo Costa Ribeiro
Genomic distance under gene substitutions. BMC Bioinform. 12(S-9): S8 (2011) - [j41]Roland Wittler, Ján Manuch, Murray Patterson, Jens Stoye
Consistency of Sequence-Based Gene Clusters. J. Comput. Biol. 18(9): 1023-1039 (2011) - [j40]Marília D. V. Braga, Eyla Willing, Jens Stoye
Double Cut and Join with Insertions and Deletions. J. Comput. Biol. 18(9): 1167-1184 (2011) - [j39]Jakub Kovác, Robert Warren, Marília D. V. Braga, Jens Stoye
Restricted DCJ Model: Rearrangement Problems with Chromosome Reincorporation. J. Comput. Biol. 18(9): 1231-1241 (2011) - 2010
- [j38]Peter Husemann, Jens Stoye
Phylogenetic comparative assembly. Algorithms Mol. Biol. 5: 3 (2010) - [j37]Peter Husemann, Jens Stoye
r2cat: synteny plots and comparative assembly. Bioinform. 26(4): 570-571 (2010) - [j36]Marília D. V. Braga, Jens Stoye
The Solution Space of Sorting by DCJ. J. Comput. Biol. 17(9): 1145-1165 (2010) - [j35]Guillaume Blin
Finding Nested Common Intervals Efficiently. J. Comput. Biol. 17(9): 1183-1194 (2010) - [j34]Anne Bergeron, Paul Medvedev, Jens Stoye
Rearrangement Models and Single-Cut Operations. J. Comput. Biol. 17(9): 1213-1225 (2010) - [c42]Søren Besenbacher
Indexing and Searching a Mass Spectrometry Database. Algorithms and Applications 2010: 62-76 - [c41]Peter Husemann, Jens Stoye:
Repeat-aware Comparative Genome Assembly. GCB 2010: 61-70 - [c40]Jakub Kovác, Marília D. V. Braga, Jens Stoye
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving. RECOMB-CG 2010: 13-24 - [c39]Roland Wittler, Jens Stoye
Consistency of Sequence-Based Gene Clusters. RECOMB-CG 2010: 252-263 - [c38]Marília D. V. Braga, Eyla Willing, Jens Stoye
Genomic Distance with DCJ and Indels. WABI 2010: 90-101 - [c37]Franziska Hufsky, Léon Kuchenbecker, Katharina Jahn, Jens Stoye
Swiftly Computing Center Strings. WABI 2010: 325-336 - [i2]Anne Bergeron, Julia Mixtacki, Jens Stoye:
A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance. Structure Discovery in Biology: Motifs, Networks & Phylogenies 2010 - [i1]Péter L. Erdös, Lajos Soukup, Jens Stoye:
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. CoRR abs/1004.2735 (2010)
2000 – 2009
- 2009
- [j33]Nils Hoffmann
ChromA: signal-based retention time alignment for chromatography-mass spectrometry data. Bioinform. 25(16): 2080-2081 (2009) - [j32]Michael Brudno, Paul Medvedev, Jens Stoye
A report on the 2009 SIG on short read sequencing and algorithms (Short-SIG). Bioinform. 25(21): 2863-2864 (2009) - [j31]Wolfgang Gerlach, Sebastian Jünemann
WebCARMA: a web application for the functional and taxonomic classification of unassembled metagenomic reads. BMC Bioinform. 10: 430 (2009) - [j30]Katharina Jahn, Jens Stoye
Approximative Gencluster und ihre Anwendung in der komparativen Genomik. Inform. Spektrum 32(4): 288-300 (2009) - [j29]Sebastian Böcker
Computation of Median Gene Clusters. J. Comput. Biol. 16(8): 1085-1099 (2009) - [j28]Jens Stoye
A Unified Approach for Reconstructing Ancient Gene Clusters. IEEE ACM Trans. Comput. Biol. Bioinform. 6(3): 387-400 (2009) - [j27]Anne Bergeron, Julia Mixtacki, Jens Stoye
A new linear time algorithm to compute the genomic distance via the double cut and join distance. Theor. Comput. Sci. 410(51): 5300-5316 (2009) - [c36]Marília D. V. Braga, Jens Stoye
Counting All DCJ Sorting Scenarios. RECOMB-CG 2009: 36-47 - [c35]Guillaume Blin
Finding Nested Common Intervals Efficiently. RECOMB-CG 2009: 59-69 - [c34]Paul Medvedev, Jens Stoye
Rearrangement Models and Single-Cut Operations. RECOMB-CG 2009: 84-97 - [c33]Peter Husemann, Jens Stoye
Phylogenetic Comparative Assembly. WABI 2009: 145-156 - 2008
- [j26]Heiko Neuweger, Stefan P. Albaum, Michael Dondrup
MeltDB: a software platform for the analysis and integration of metabolomics experiment data. Bioinform. 24(23): 2726-2732 (2008) - [j25]Sebastian Oehm, David R. Gilbert, Andreas Tauch, Jens Stoye
Comparative Pathway Analyzer - a web server for comparative analysis, clustering and visualization of metabolic networks in multiple organisms. Nucleic Acids Res. 36(Web-Server-Issue): 433-437 (2008) - [j24]Klaus-Bernd Schürmann, Jens Stoye
Counting suffix arrays and strings. Theor. Comput. Sci. 395(2-3): 220-234 (2008) - [c32]Anne Bergeron, Julia Mixtacki, Jens Stoye
HP Distance Via Double Cut and Join Distance. CPM 2008: 56-68 - [c31]Anne Bergeron, Julia Mixtacki, Jens Stoye
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios. RECOMB-CG 2008: 226-240 - [c30]Sebastian Böcker
Computation of Median Gene Clusters. RECOMB 2008: 331-345 - [c29]José Augusto Amgarten Quitzau, Jens Stoye
Detecting Repeat Families in Incompletely Sequenced Genomes. WABI 2008: 342-353 - [r1]Jens Stoye
Suffix Tree Construction in RAM. Encyclopedia of Algorithms 2008 - 2007
- [j23]Gilles Didier
Character sets of strings. J. Discrete Algorithms 5(2): 330-340 (2007) - [j22]Klaus-Bernd Schürmann, Jens Stoye
An incomplex algorithm for fast suffix array construction. Softw. Pract. Exp. 37(3): 309-329 (2007) - [p1]Anne Bergeron, Julia Mixtacki, Jens Stoye:
The inversion distance problem. Mathematics of Evolution and Phylogeny 2007 - 2006
- [j21]Michael Sammeth
Panta rhei (QAlign2): an open graphical environment for sequence analysis. Bioinform. 22(7): 889-890 (2006) - [j20]Kim R. Rasmussen, Jens Stoye
Efficient q-Gram Filters for Finding All epsilon-Matches over a Given Length. J. Comput. Biol. 13(2): 296-308 (2006) - [j19]Anne Bergeron, Julia Mixtacki, Jens Stoye
On Sorting by Translocations. J. Comput. Biol. 13(2): 567-578 (2006) - [j18]Anne Bergeron, Jens Stoye
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. J. Comput. Biol. 13(7): 1340-1354 (2006) - [j17]Michael Sammeth
Comparing Tandem Repeats with Duplications and Excisions of Variable Degree. IEEE ACM Trans. Comput. Biol. Bioinform. 3(4): 395-407 (2006) - [c28]Lutz Krause
Finding novel genes in bacterial communities isolated from the environment. ISMB (Supplement of Bioinformatics) 2006: 281-289 - [c27]Anne Bergeron, Julia Mixtacki, Jens Stoye
A Unifying View of Genome Rearrangements. WABI 2006: 163-173 - 2005
- [j16]Daniela Bartels, Sebastian Kespohl, Stefan P. Albaum, Tanja Drüke, Alexander Goesmann
BACCardI-a tool for the validation of genomic assemblies, assisting genome finishing and intergenome comparison. Bioinform. 21(7): 853-859 (2005) - [j15]Antje Krause, Jens Stoye
Large scale hierarchical clustering of protein sequences. BMC Bioinform. 6: 15 (2005) - [c26]Klaus-Bernd Schürmann, Jens Stoye:
An Incomplex Algorithm for Fast Suffix Array Construction. ALENEX/ANALCO 2005: 78-85 - [c25]Constantin Bannert, Jens Stoye
Protein Annotation by Secondary Structure Based Alignments (PASSTA). CompLife 2005: 79-90 - [c24]Kim R. Rasmussen, Jens Stoye
Efficient q-Gram Filters for Finding All epsilon-Matches over a Given Length. RECOMB 2005: 189-203 - [c23]Anne Bergeron, Julia Mixtacki, Jens Stoye
On Sorting by Translocations. RECOMB 2005: 615-629 - [c22]Klaus-Bernd Schürmann, Jens Stoye
Counting Suffix Arrays and Strings. SPIRE 2005: 55-66 - [c21]Michael Sammeth, Thomas Weniger, Dag Harmsen, Jens Stoye
Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI). WABI 2005: 276-290 - 2004
- [j14]Daniel A. Pollard, Casey M. Bergman
Benchmarking tools for the alignment of functional noncoding DNA. BMC Bioinform. 5: 6 (2004) - [j13]Daniel A. Pollard, Casey M. Bergman, Jens Stoye
Correction: Benchmarking tools for the alignment of functional noncodingDNA. BMC Bioinform. 5: 73 (2004) - [j12]Mark Cieliebak, Thomas Erlebach
Algorithmic complexity of protein identification: combinatorics of weighted strings. Discret. Appl. Math. 137(1): 27-46 (2004) - [j11]Dan Gusfield, Jens Stoye
Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69(4): 525-546 (2004) - [c20]Thomas Schmidt, Jens Stoye
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences. CPM 2004: 347-358 - [c19]Anne Bergeron, Julia Mixtacki, Jens Stoye
Reversal Distance without Hurdles and Fortresses. CPM 2004: 388-399 - [c18]Morris Michael, Christoph Dieterich, Jens Stoye
Suboptimal Local Alignments Across Multiple Scoring Schemes. WABI 2004: 99-110 - [e2]Robert Giegerich, Jens Stoye:
Proceedings of the German Conference on Bioinformatics (GCB 2004), Bielefeld, Germany, October 4-6, 2004. LNI P-53, GI 2004, ISBN 3-88579-382-2 [contents] - 2003
- [j10]Michael Sammeth, Jörg Rothgänger, W. Esser, Jürgen Albert, Jens Stoye, Dag Harmsen:
Digital extractor: analysis of digital differential display output. Bioinform. 19(12): 1592-1593 (2003) - [j9]Robert Giegerich, Stefan Kurtz, Jens Stoye
Efficient implementation of lazy suffix trees. Softw. Pract. Exp. 33(11): 1035-1049 (2003) - [c17]Anne Bergeron, Jens Stoye
On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. COCOON 2003: 68-79 - [c16]Michael Sammeth, Burkhard Morgenstern, Jens Stoye:
Divide-and-conquer multiple alignment with segment-based constraints. ECCB 2003: 189-195 - [c15]Constantin Bannert, Jens Stoye:
Evaluation of the Jumping Alignment algorithm with artificial and biological data. German Conference on Bioinformatics 2003: 21-25 - 2002
- [j8]Rainer Spang
A Novel Approach to Remote Homology Detection: Jumping Alignments. J. Comput. Biol. 9(5): 747-760 (2002) - [j7]Jens Stoye
Simple and flexible detection of contiguous repeats using a suffix tree. Theor. Comput. Sci. 270(1-2): 843-856 (2002) - [c14]Anne Bergeron, Steffen Heber, Jens Stoye:
Common intervals and sorting by reversals: a marriage of necessity. ECCB 2002: 54-63 - [c13]Jens Stoye:
Index Structures for Large Sequence Data: Suffix Trees and Affix Trees. GI Jahrestagung (Ergänzungsband) 2002: 67-71 - [c12]Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. IFIP TCS 2002: 143-156 - 2001
- [c11]Steffen Heber
Finding All Common Intervals of k Permutations. CPM 2001: 207-218 - [c10]Constantin Bannert, Marc Rehmsmeier, Rainer Spang, Jens Stoye:
Sequence Database Search Using Jumping Alignments. German Conference on Bioinformatics 2001: 142 - [c9]Steffen Heber, Jens Stoye
Algorithms for Finding Gene Clusters. WABI 2001: 252-263 - 2000
- [j6]Knut Reinert
An iterative method for faster sum-of-pairs multiple sequence alignment. Bioinform. 16(9): 808-814 (2000) - [j5]Steffen Heber, Jens Stoye
Contig Selection in Physical Mapping. J. Comput. Biol. 7(3-4): 395-408 (2000) - [j4]Antje Krause, Jens Stoye
The SYSTERS protein sequence cluster set. Nucleic Acids Res. 28(1): 270-272 (2000) - [c8]Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, Robert Giegerich:
Computation and Visualization of Degenerate Repeats in Complete Genomes. ISMB 2000: 228-238 - [c7]Rainer Spang, Marc Rehmsmeier, Jens Stoye:
Sequence Database Search Using Jumping Alignments. ISMB 2000: 367-375 - [c6]Steffen Heber, Jens Stoye, Jörg D. Hoheisel, Martin Vingron:
Contig selection in physical mapping. RECOMB 2000: 155-164 - [e1]Erich Bornberg-Bauer, Ursula Rost, Jens Stoye:
Proceedings of the German Conference on Bioinformatics (GCB 2000), Heidelberg, October 5-7, 2000. Logos Verlag 2000, ISBN 3-89722-498-4 [contents]
1990 – 1999
- 1999
- [c5]Gerth Stølting Brodal
Finding Maximal Pairs with Bounded Gap. CPM 1999: 134-149 - [c4]Knut Reinert, Jens Stoye, Torsten Will:
Combining Divide-and-Conquer, the A*-Algorithm, and Successive Realignment Approaches to Speed Multiple Sequence Alignment. German Conference on Bioinformatics 1999: 17-24 - [c3]Robert Giegerich, Stefan Kurtz, Jens Stoye
Efficient Implementation of Lazy Suffix Trees. WAE 1999: 30-42 - 1998
- [j3]Jens Stoye
Rose: generating sequence families. Bioinform. 14(2): 157-163 (1998) - [c2]Jens Stoye
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). CPM 1998: 140-152 - 1997
- [j2]Jens Stoye, Vincent Moulton
DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. Comput. Appl. Biosci. 13(6): 625-626 (1997) - [j1]Gunnar Brinkmann, Andreas W. M. Dress, Sören Perrey, Jens Stoye
Two applications of the Divide&Conquer principle in the molecular sciences. Math. Program. 79: 71-97 (1997) - [c1]Jens Stoye, Dirk Evers, Folker Meyer:
Generating Benchmarks for Multiple Sequence Alignments and Phylogenic Reconstructions. ISMB 1997: 303-306
Coauthor Index
Marília D. V. Braga
aka: Marília Dias Vieira Braga
aka: Marília Dias Vieira Braga
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: