Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Three-dimensional protein structure prediction: Methods and computational strategies
A long standing problem in structural bioinformatics is to determine the three-dimensional (3-
D) structure of a protein when only a sequence of amino acid residues is given. Many …
D) structure of a protein when only a sequence of amino acid residues is given. Many …
Rational design of DNA nanoarchitectures
U Feldkamp, CM Niemeyer - … Chemie International Edition, 2006 - Wiley Online Library
DNA has many physical and chemical properties that make it a powerful material for
molecular constructions at the nanometer length scale. In particular, its ability to form …
molecular constructions at the nanometer length scale. In particular, its ability to form …
[图书][B] Data mining: concepts and techniques
Data Mining: Concepts and Techniques, Fourth Edition introduces concepts, principles, and
methods for mining patterns, knowledge, and models from various kinds of data for diverse …
methods for mining patterns, knowledge, and models from various kinds of data for diverse …
[图书][B] Introduction to algorithms
A comprehensive update of the leading algorithms text, with new material on matchings in
bipartite graphs, online algorithms, machine learning, and other topics. Some books on …
bipartite graphs, online algorithms, machine learning, and other topics. Some books on …
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
RC Edgar - BMC bioinformatics, 2004 - Springer
Background In a previous paper, we introduced MUSCLE, a new program for creating
multiple alignments of protein sequences, giving a brief summary of the algorithm and …
multiple alignments of protein sequences, giving a brief summary of the algorithm and …
An improved general amino acid replacement matrix
Amino acid replacement matrices are an essential basis of protein phylogenetics. They are
used to compute substitution probabilities along phylogeny branches and thus the likelihood …
used to compute substitution probabilities along phylogeny branches and thus the likelihood …
A survey on tree edit distance and related problems
P Bille - Theoretical computer science, 2005 - Elsevier
We survey the problem of comparing labeled trees based on simple local operations of
deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance …
deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance …
[图书][B] Evolutionary computation for modeling and optimization
D Ashlock - 2006 - Springer
Evolutionary Computation for Optimization and Modeling is an introduction to evolutionary
computation, a field which includes genetic algorithms, evolutionary programming, evolution …
computation, a field which includes genetic algorithms, evolutionary programming, evolution …
Quadratic conditional lower bounds for string problems and dynamic time war**
Classic similarity measures of strings are longest common subsequence and Levenshtein
distance (ie, The classic edit distance). A classic similarity measure of curves is dynamic …
distance (ie, The classic edit distance). A classic similarity measure of curves is dynamic …
[图书][B] Life out of sequence: a data-driven history of bioinformatics
H Stevens - 2019 - degruyter.com
Thirty years ago, the most likely place to find a biologist was standing at a laboratory bench,
peering down a microscope, surrounded by flasks of chemicals and petri dishes full of …
peering down a microscope, surrounded by flasks of chemicals and petri dishes full of …