Results 101 to 110 of about 8,102,704 (303)
Circular Sequence Comparison with q-grams [PDF]
International audienceSequence comparison is a fundamental step in many important tasks in bioinformatics. Traditional algorithms for measuring approximation in sequence comparison are based on the notions of distance or similarity, and are generally ...
Retha, Ahmad +17 more
core +1 more source
Mycobacterial 3‐methylcrotonyl‐CoA carboxylase uses a mobile biotin‐carrying domain to shuttle a carboxyl group between two catalytic sites, enabling carboxylation of 3‐methylcrotonyl‐CoA during leucine breakdown. Cryo‐electron microscopy captures the carrier at both sites and reveals an inward loop movement that may prevent futile rebinding to the ...
Ajit Yadav +2 more
wiley +1 more source
This paper is an extension of a deterministic algorithm, [1, 2], that was initially designed to measure the rate of similarity between DNA sequences, and any sequences made up with symbols of alphabets of cardinality 4.
A. Kheniche, N. Brahimi, A. Salhi
doaj +1 more source
Automated generation of heuristics for biological sequence comparison
Background Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement.
Birney Ewan, Slater Guy
doaj +1 more source
Quality of Algorithms for Sequence Comparison [PDF]
Pair-wise sequence alignment is the basic method of comparative analysis of proteins and nucleic acids. Studying the results of the alignment one has to consider two questions: (1) did the program find all the interesting similarities ("sensitivity") and (2) are all the found similarities interesting ("selectivity").
openaire +2 more sources
Amino acid sequence comparison of the deduced CHH-family member.
Amino acid sequence comparison of the deduced CHH-family member.
Bin Li (39349) +4 more
core +1 more source
High Performance Biological Pairwise Sequence Alignment: FPGA versus GPU versus Cell BE versus GPP [PDF]
This paper explores the pros and cons of reconfigurable computing in the form of FPGAs for high performance efficient computing. In particular, the paper presents the results of a comparative study between three different acceleration technologies ...
Liu, Ying +11 more
core +1 more source
How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +1 more source
A Comparison Theorem for Spectral Sequences
We give a comparison result for two first quadrant spectral sequences that are isomorphic at every point other than the bottom horizontal line and the one that is the source of the map vanishes on that line. This situation comes out naturally when comparing niveau spectral sequences related to certain homology theories and an example is given here.
openaire +2 more sources
Functional Sequence Comparison
This MSc dissertation develops a functional approach to sequence comparison algorithms.The development is via a one-dimensional problem and two approaches to a particular two-dimensional problem.
Wolfson Buildingparks +1 more
core

