Остановите войну!
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 24 matches
- 2019
- Elizabeth S. Allman, Hector Baños, John A. Rhodes:
NANUQ: a method for inferring species networks from gene trees under the coalescent model. Algorithms Mol. Biol. 14(1): 24 (2019) - Christophe Ambroise, Alia Dehman, Pierre Neuvial, Guillem Rigaill, Nathalie Villa-Vialaneix:
Adjacency-constrained hierarchical clustering of a band similarity matrix with application to genomics. Algorithms Mol. Biol. 14(1): 22:1-22:14 (2019) - Christina Boucher, Travis Gagie, Alan Kuhnle, Ben Langmead, Giovanni Manzini, Taher Mun:
Prefix-free parsing for building big BWTs. Algorithms Mol. Biol. 14(1): 13:1-13:15 (2019) - Leonid Chindelevitch, Sean La, Joao Meidanis:
A cubic algorithm for the generalized rank median of three genomes. Algorithms Mol. Biol. 14(1): 16:1-16:16 (2019) - Riccardo Dondi, Manuel Lafond, Céline Scornavacca:
Reconciling multiple genes trees via segmental duplications and losses. Algorithms Mol. Biol. 14(1): 7:1-7:19 (2019) - Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles:
External memory BWT and LCP computation for sequence collections with applications. Algorithms Mol. Biol. 14(1): 6:1-6:15 (2019) - Martin S. Engler, Bertrand Caron, Lourens E. Veen, Daan P. Geerke, Alan E. Mark, Gunnar W. Klau:
Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach. Algorithms Mol. Biol. 14(1): 1:1-1:10 (2019) - Morteza Chalabi Hajkarim, Eli Upfal, Fabio Vandin:
Differentially mutated subnetworks discovery. Algorithms Mol. Biol. 14(1): 10:1-10:11 (2019) - Nikolai Karpov, Salem Malikic, Md. Khaledur Rahman, Süleyman Cenk Sahinalp:
A multi-labeled tree dissimilarity measure for comparing "clonal trees" of tumor progression. Algorithms Mol. Biol. 14(1): 17:1-17:18 (2019) - Hisanori Kiryu, Yuto Ichikawa, Yasuhiro Kojima:
TMRS: an algorithm for computing the time to the most recent substitution event from a multiple alignment column. Algorithms Mol. Biol. 14(1): 23:1-23:14 (2019) - Alexandre Lemos, Inês Lynce, Pedro T. Monteiro:
Repairing Boolean logical models from time-series data using Answer Set Programming. Algorithms Mol. Biol. 14(1): 9:1-9:16 (2019) - Erin K. Molloy, Tandy J. Warnow:
Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge. Algorithms Mol. Biol. 14(1): 14:1-14:17 (2019) - Martin D. Muggli, Simon J. Puglisi, Christina Boucher:
Kohdista: an efficient method to index and query possible Rmap alignments. Algorithms Mol. Biol. 14(1): 25 (2019) - Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen:
Linear time minimum segmentation enables scalable founder reconstruction. Algorithms Mol. Biol. 14(1): 12:1-12:15 (2019) - Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias:
Super short operations on both gene order and intergenic sizes. Algorithms Mol. Biol. 14(1): 21:1-21:17 (2019) - Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
SNPs detection by eBWT positional clustering. Algorithms Mol. Biol. 14(1): 3:1-3:13 (2019) - Yohei M. Rosen, Benedict J. Paten:
An average-case sublinear forward algorithm for the haploid Li and Stephens model. Algorithms Mol. Biol. 14(1): 11:1-11:12 (2019) - Emre Sefer, Carl Kingsford:
Semi-nonparametric modeling of topological domain formation from epigenetic data. Algorithms Mol. Biol. 14(1): 4:1-4:11 (2019) - Pijus Simonaitis, Annie Chateau, Krister M. Swenson:
A general framework for genome rearrangement with biological constraints. Algorithms Mol. Biol. 14(1): 15:1-15:14 (2019) - Riku Walve, Pasi Rastas, Leena Salmela:
Kermit: linkage map guided long read assembly. Algorithms Mol. Biol. 14(1): 8:1-8:10 (2019) - John Wiedenhoeft, Alex Cagan, Rimma Kozhemyakina, Rimma Gulevich, Alexander Schliep:
Bayesian localization of CNV candidates in WGS data within minutes. Algorithms Mol. Biol. 14(1): 20:1-20:16 (2019) - Jimmy Wu, Alex Khodaverdian, Benjamin Weitz, Nir Yosef:
Connectivity problems on heterogeneous graphs. Algorithms Mol. Biol. 14(1): 5:1-5:17 (2019) - Qiuyi Zhang, Satish Rao, Tandy J. Warnow:
Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy. Algorithms Mol. Biol. 14(1): 2:1-2:12 (2019) - Yue Zhang, Chunfang Zheng, David Sankoff:
A branching process for homology distribution-based inference of polyploidy, speciation and loss. Algorithms Mol. Biol. 14(1): 18:1-18:13 (2019)
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-28 12:15 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