Остановите войну!
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 32 matches
- 2012
- Isra Al-Turaiki, Ghada Badr, Hassan Mathkour:
Trie-based Apriori Motif Discovery Approach. ISBRA 2012: 1-12 - Laurent Bulteau, Minghui Jiang:
Inapproximability of (1, 2)-Exemplar Distance. ISBRA 2012: 13-23 - Daniele Catanzaro, Martine Labbé, Bjarni V. Halldórsson:
A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem. ISBRA 2012: 24-35 - Xi Chen, Chen Wang, Ayesha N. Shajahan, Rebecca B. Riggins, Robert Clarke, Jianhua Xuan:
Reconstruction of Transcription Regulatory Networks by Stability-Based Network Component Analysis. ISBRA 2012: 36-47 - Yann Christinat, Bernard M. E. Moret:
A Transcript Perspective on Evolution. ISBRA 2012: 48-59 - Ralph W. Crosby, Tiffani L. Williams:
A Fast Algorithm for Computing the Quartet Distance for Large Sets of Evolutionary Trees. ISBRA 2012: 60-71 - Peter Damaschke, Leonid Molokov:
Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices. ISBRA 2012: 72-83 - Bhaskar DasGupta:
Models and Algorithmic Tools for Computational Processes in Cellular Biology: Recent Developments and Future Directions - (Invited Keynote Talk). ISBRA 2012: 84-86 - Akshay Deepak, Jianrong Dong, David Fernández-Baca:
Identifying Rogue Taxa through Reduced Consensus: NP-Hardness and Exact Algorithms. ISBRA 2012: 87-98 - Cynthia Gibas:
Analytics Approaches for the Era of 10, 000* Genomes *and Counting. ISBRA 2012: 99-101 - Pawel Górecki, J. Gordon Burleigh, Oliver Eulenstein:
GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches. ISBRA 2012: 102-114 - Pawel Górecki, Oliver Eulenstein:
A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees. ISBRA 2012: 115-126 - Fei Guo, Shuai Cheng Li, Lusheng Wang:
P-Binder: A System for the Protein-Protein Binding Sites Identification. ISBRA 2012: 127-138 - Bonnie Kirkpatrick:
Non-identifiable Pedigrees and a Bayesian Solution. ISBRA 2012: 139-152 - Juntao Li, Kwok Pui Choi, R. Krishna Murthy Karuturi:
Iterative Piecewise Linear Regression to Accurately Assess Statistical Significance in Batch Confounded Differential Expression Analysis. ISBRA 2012: 153-164 - Si Li, Kwok Pui Choi, Taoyang Wu, Louxin Zhang:
Reconstruction of Network Evolutionary History from Extant Network Topology and Duplication History. ISBRA 2012: 165-176 - Victor Missirian, Isabelle Henry, Luca Comai, Vladimir Filkov:
POPE: Pipeline of Parentally-Biased Expression. ISBRA 2012: 177-188 - Jirí Novák, David Hoksza, Jakub Lokoc, Tomás Skopal:
On Optimizing the Non-metric Similarity Search in Tandem Mass Spectra by Clustering. ISBRA 2012: 189-200 - Aïda Ouangraoua, Krister M. Swenson, Anne Bergeron:
On the Comparison of Sets of Alternative Transcripts. ISBRA 2012: 201-212 - Hyun Jung Park, Luay Nakhleh:
MURPAR: A Fast Heuristic for Inferring Parsimonious Phylogenetic Networks from Multiple Gene Trees. ISBRA 2012: 213-224 - Matteo Re, Giorgio Valentini:
Large Scale Ranking and Repositioning of Drugs with Respect to DrugBank Therapeutic Categories. ISBRA 2012: 225-236 - Debarka Sengupta, Ujjwal Maulik, Sanghamitra Bandyopadhyay:
Score Based Aggregation of microRNA Target Orderings. ISBRA 2012: 237-248 - Ambuj K. Singh:
Modeling Complex Diseases Using Discriminative Network Fragments - (Invited Keynote Talk). ISBRA 2012: 249 - Ayshwarya Subramanian, Stanley Shackney, Russell Schwartz:
Novel Multi-sample Scheme for Inferring Phylogenetic Markers from Whole Genome Tumor Profiles. ISBRA 2012: 250-262 - André Wehe, J. Gordon Burleigh, Oliver Eulenstein:
Algorithms for Knowledge-Enhanced Supertrees. ISBRA 2012: 263-274 - Lars Wienbrandt, Daniel Siebert, Manfred Schimmler:
Improvement of BLASTp on the FPGA-Based High-Performance Computer RIVYERA. ISBRA 2012: 275-286 - Tim Wylie, Binhai Zhu:
A Polynomial Time Solution for Protein Chain Pair Simplification under the Discrete Fréchet Distance. ISBRA 2012: 287-298 - Rukhsana Yeasmin, Steven Skiena:
Designing RNA Secondary Structures in Coding Regions. ISBRA 2012: 299-314 - Junjie Yu, Henry Chi-Ming Leung, Siu-Ming Yiu, Yong Zhang, Francis Y. L. Chin, Nathan Hobbs, Amy Y. X. Wang:
Phylogenetic Tree Reconstruction with Protein Linkage. ISBRA 2012: 315-327 - Michael Q. Zhang:
Computational Modeling of Mammalian Promoters - (Invited Keynote Talk). ISBRA 2012: 330
skipping 2 more matches
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-08-05 13:01 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