Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 21 matches
- 2023
- Giulia Bernardini, Leo van Iersel, Esther Julien, Leen Stougie:
Constructing phylogenetic networks via cherry picking and machine learning. Algorithms Mol. Biol. 18(1): 13 (2023) - Konstantinn Bonnet, Tobias Marschall, Daniel Doerr:
Constructing founder sets under allelic and non-allelic homologous recombination. Algorithms Mol. Biol. 18(1): 15 (2023) - Konstantinn Bonnet, Tobias Marschall, Daniel Doerr:
Correction: Constructing founder sets under allelic and non-allelic homologous recombination. Algorithms Mol. Biol. 18(1): 20 (2023) - Ke Chen, Mingfu Shao:
Locality-sensitive bucketing functions for the edit distance. Algorithms Mol. Biol. 18(1): 7 (2023) - Mohammad Fili, Guiping Hu, Changze Han, Alexa Kort, John Trettin, Hillel Haim:
A classification algorithm based on dynamic ensemble selection to predict mutational patterns of the envelope protein in HIV-infected patients. Algorithms Mol. Biol. 18(1): 4 (2023) - Mathieu Gascon, Nadia El-Mabrouk:
On the complexity of non-binary tree reconciliation with endosymbiotic gene transfer. Algorithms Mol. Biol. 18(1): 9 (2023) - Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini:
phyBWT2: phylogeny reconstruction via eBWT positional clustering. Algorithms Mol. Biol. 18(1): 11 (2023) - Yunheng Han, Erin K. Molloy:
Quartets enable statistically consistent estimation of cell lineage trees under an unbiased error and missingness model. Algorithms Mol. Biol. 18(1): 19 (2023) - Yifan Jin, Jonathan Terhorst:
The solution surface of the Li-Stephens haplotype copying model. Algorithms Mol. Biol. 18(1): 12 (2023) - Seong-Hwan Jun, Hassan Nasif, Chris Jennings-Shaffer, David H. Rich, Anna Kooperberg, Mathieu Fourment, Cheng Zhang, Marc A. Suchard, Frederick A. Matsen IV:
A topology-marginal composite likelihood via a generalized phylogenetic pruning algorithm. Algorithms Mol. Biol. 18(1): 10 (2023) - Baqiao Liu, Tandy J. Warnow:
Weighted ASTRID: fast and accurate species trees from weighted internode distances. Algorithms Mol. Biol. 18(1): 6 (2023) - Bertrand Marchand, Sebastian Will, Sarah J. Berkemer, Yann Ponty, Laurent Bulteau:
Automated design of dynamic programming schemes for RNA folding with pseudoknots. Algorithms Mol. Biol. 18(1): 18 (2023) - Shaili Mathur, Noah A. Rosenberg:
All galls are divided into three or more parts: recursive enumeration of labeled histories for galled trees. Algorithms Mol. Biol. 18(1): 1 (2023) - Taher Mun, Naga Sai Kavya Vaddadi, Ben Langmead:
Pangenomic genotyping with the marker array. Algorithms Mol. Biol. 18(1): 2 (2023) - Eden Ozeri, Meirav Zehavi, Michal Ziv-Ukelson:
New algorithms for structure informed genome rearrangement. Algorithms Mol. Biol. 18(1): 17 (2023) - Giulio Ermanno Pibiri:
On weighted k-mer dictionaries. Algorithms Mol. Biol. 18(1): 3 (2023) - Diego P. Rubert, Marília D. V. Braga:
Efficient gene orthology inference via large-scale rearrangements. Algorithms Mol. Biol. 18(1): 14 (2023) - David Schaller, Tom Hartmann, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Relative timing information and orthology in evolutionary scenarios. Algorithms Mol. Biol. 18(1): 16 (2023) - Sebastian S. Schmidt, Jarno N. Alanko:
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. Algorithms Mol. Biol. 18(1): 5 (2023) - Chengze Shen, Baqiao Liu, Kelly P. Williams, Tandy J. Warnow:
EMMA: a new method for computing multiple sequence alignments given a constraint subset alignment. Algorithms Mol. Biol. 18(1): 21 (2023) - Hua-Ting Yao, Ronny Lorenz, Ivo L. Hofacker, Peter F. Stadler:
Mono-valent salt corrections for RNA secondary structures in the ViennaRNA package. Algorithms Mol. Biol. 18(1): 8 (2023)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-10 00:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint