Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/BirolLab/abyss
/ types & classes
Types & classes
463 in github.com/BirolLab/abyss
⨍
Functions
2,058
◇
Types & classes
463
↓ 64 callers
Class
expect
This input stream manipulator skips the specified string. */
Common/IOUtil.h:39
↓ 32 callers
Class
RollingHash
BloomDBG/RollingHash.h:18
↓ 30 callers
Class
ContigNode
A vertex of a contig graph, which is a pair of a contig index and * an orientation. */
Common/ContigNode.h:19
↓ 23 callers
Class
Kmer
A k-mer. */
Common/Kmer.h:13
↓ 22 callers
Class
Ignore
This input stream manipulator discards characters until reaching * the delimeter. */
Common/IOUtil.h:72
↓ 13 callers
Class
KmerPair
A pair of k-mer. */
PairedDBG/KmerPair.h:12
↓ 9 callers
Class
Support
RResolver/RAlgorithmsShort.h:92
↓ 8 callers
Enum
SeqFlag
Assembly/VertexData.h:9
↓ 7 callers
Class
Dinuc
A pair of nucleotides. */
PairedDBG/Dinuc.h:9
↓ 6 callers
Class
ReadRecord
* Records results of processing a sequencing read. * Each instance represents a row in the read log file generated * by the `--read-log` option of `
BloomDBG/bloom-dbg.h:300
↓ 6 callers
Class
RepeatInstance
RResolver/RAlgorithmsShort.cpp:871
↓ 5 callers
Class
ContigProperties
The length and coverage of a contig. */
Common/ContigProperties.h:66
↓ 5 callers
Class
NoProperty
No property. */
Graph/Properties.h:63
↓ 5 callers
Class
Skip
Skip the specified character if it's next in the input stream. */
Common/IOUtil.h:86
↓ 5 callers
Class
Translate
FMIndex/FMIndex.h:450
↓ 4 callers
Class
BetterDistanceEst
Return the better of two distance estimates. * Return the estimate whose error is least, or when the errors are * equal, return the larger distance
Common/Estimate.h:112
↓ 4 callers
Class
DisallowParallelEdges
Disallow parallel edges. */
Graph/GraphIO.h:85
↓ 4 callers
Class
Match
FMIndex/FMIndex.h:58
↓ 4 callers
Class
SAInterval
FMIndex/FMIndex.h:39
↓ 4 callers
Class
Vertex
A vertex of the overlap graph. */
PathOverlap/PathOverlap.cpp:148
↓ 4 callers
Class
edge_iterator
Iterate through edges. */
Graph/UndirectedGraph.h:193
↓ 3 callers
Class
BranchRecord
A sequence of vertices. */
Assembly/BranchRecordBase.h:29
↓ 3 callers
Class
ContigID
A contig index. */
Common/ContigID.h:59
↓ 3 callers
Class
FastaRecord
A FASTA record. */
DataLayer/FastaReader.h:123
↓ 3 callers
Class
SAMRecord
A SAM alignment of a query and its mate. */
Common/SAM.h:225
↓ 3 callers
Class
ShorterThanX
FilterGraph/FilterGraph.cc:440
↓ 3 callers
Class
stat
dialign/parameters.c:228
↓ 2 callers
Class
AddLength
Functor to add the number of k-mer in two contigs. */
MergePaths/MergePaths.cpp:1109
↓ 2 callers
Class
AmbPathConstraint
MergePaths/PathConsensus.cpp:155
↓ 2 callers
Class
BranchGroup
A container of BranchRecord. */
Assembly/BranchGroup.h:20
↓ 2 callers
Class
ContigNodeIndexMap
Vertex index property map of a ContigNode. */
Common/ContigNode.h:161
↓ 2 callers
Class
CountKmerVisitor
Count k-mer. */
FMIndex/count.cc:85
↓ 2 callers
Class
CoverageLessThan
FilterGraph/FilterGraph.cc:484
↓ 2 callers
Class
EdgeName
The string representation of an edge name. */
Common/ContigNode.h:255
↓ 2 callers
Class
NewEdge
RResolver/RAlgorithmsShort.cpp:847
↓ 2 callers
Class
OldEdge
RResolver/RAlgorithmsShort.cpp:836
↓ 2 callers
Class
Overlap
A small struct for holding overlap information: just a sequence and offset from the focal read */
DAssembler/DAssembler.cpp:73
↓ 2 callers
Class
RotatedRead
DAssembler/RotatedRead.h:7
↓ 2 callers
Class
SequenceTreeNode
RResolver/SequenceTree.cpp:11
↓ 2 callers
Class
Vertex
Graph/UndirectedGraph.h:264
↓ 2 callers
Class
VertexName
The string representation of a vertex name. */
Common/ContigNode.h:200
↓ 2 callers
Class
aMap
Common/InsOrderedMap.h:23
↓ 2 callers
Class
adjacency_iterator
Graph/HashGraph.h:239
↓ 2 callers
Class
adjacency_iterator
Konnector/DBGBloom.h:106
↓ 2 callers
Class
adjacency_iterator
BloomDBG/RollingBloomDBG.h:237
↓ 2 callers
Class
adjacency_iterator
Assembly/DBG.h:466
↓ 2 callers
Class
edge_iterator
Graph/DirectedGraph.h:149
↓ 2 callers
Class
in_edge_iterator
Assembly/DBG.h:578
↓ 2 callers
Class
out_edge_iterator
Iterate through the out-edges. */
Graph/UndirectedGraph.h:136
↓ 2 callers
Class
out_edge_iterator
Graph/HashGraph.h:297
↓ 2 callers
Class
out_edge_iterator
Graph/DirectedGraph.h:86
↓ 2 callers
Class
out_edge_iterator
Assembly/DBG.h:522
↓ 2 callers
Class
vertex_iterator
Iterate through the vertices of this graph. */
Graph/UndirectedGraph.h:104
↓ 2 callers
Class
vertex_iterator
Graph/HashGraph.h:182
↓ 2 callers
Class
vertex_iterator
Graph/DirectedGraph.h:54
↓ 1 callers
Class
AllowParallelEdges
Allow parallel edges. */
Scaffold/junction.cc:127
↓ 1 callers
Class
BaseChangeScore
Konnector/DBGBloomAlgorithms.h:110
↓ 1 callers
Class
BitArray
FMIndex/bit_array.h:33
↓ 1 callers
Class
ClosedGap
The coordinates of a gap, its flanking scaftigs, and the sequence that * fills it. */
Sealer/sealer.cc:347
↓ 1 callers
Class
Compare
Common/SuffixArray.h:68
↓ 1 callers
Class
CompareCoverage
PopBubbles/PopBubbles.cpp:183
↓ 1 callers
Class
CompareOffset
DataLayer/FastaIndex.h:48
↓ 1 callers
Class
Contig
A contig sequence. */
MergePaths/MergeContigs.cpp:139
↓ 1 callers
Class
CountingOutputIterator
A counting output iterator. */
Common/Iterator.h:7
↓ 1 callers
Class
DAWGVisitor
DAWG visitor. */
FMIndex/abyss-dawg.cc:62
↓ 1 callers
Class
Edge
Graph/UndirectedGraph.h:67
↓ 1 callers
Class
Edge
Graph/DirectedGraph.h:18
↓ 1 callers
Class
EdgeHash
Graph/ConstrainedBidiBFSVisitor.h:30
↓ 1 callers
Class
FAIRecord
A record of an indexed FASTA file. */
DataLayer/FastaIndex.h:14
↓ 1 callers
Class
FastqRecord
A FASTQ record. */
DataLayer/FastaReader.h:167
↓ 1 callers
Class
Gap
The coordinates of a gap and its flanking scaftigs. */
Sealer/sealer.cc:315
↓ 1 callers
Class
InvalidEdge
Return whether this edge is invalid. * An edge is invalid when the overlap is larger than the length of * either of its incident sequences. */
Scaffold/scaffold.cc:189
↓ 1 callers
Class
IsPathOverlap
Return true if the edge e is a path overlap. */
PathOverlap/PathOverlap.cpp:510
↓ 1 callers
Class
IsSmallOverlap
Return true if the edge is a small overlap. */
Layout/layout.cc:142
↓ 1 callers
Class
KmerIterator
Common/KmerIterator.h:10
↓ 1 callers
Class
LongerThanX
FilterGraph/FilterGraph.cc:462
↓ 1 callers
Class
Marked
Return the value of the bit at the specified index. */
FilterGraph/FilterGraph.cc:385
↓ 1 callers
Enum
NetworkAssemblyState
Parallel/NetworkSequenceCollection.h:21
↓ 1 callers
Class
NewVertex
RResolver/RAlgorithmsShort.cpp:860
↓ 1 callers
Class
NewVertex
A new vertex and two edges that will be added to the graph. */
MergePaths/PathConsensus.cpp:280
↓ 1 callers
Class
OutData
Stores the output string and the read index number for an * alignment. */
KAligner/KAligner.cpp:198
↓ 1 callers
Class
Overlap
An overlap of two sequences. */
Overlap/Overlap.cpp:212
↓ 1 callers
Class
Overlap
An alignment of two overlapping contigs. */
PathOverlap/PathOverlap.cpp:169
↓ 1 callers
Class
PoorSupport
Return whether the specified edges has sufficient support. */
Scaffold/scaffold.cc:205
↓ 1 callers
Class
PoorSupport
Return whether the specified edge has sufficient support. */
SimpleGraph/SimpleGraph.cpp:653
↓ 1 callers
Class
Position
A tuple of a target ID and position. */
KAligner/Aligner.h:26
↓ 1 callers
Class
ReadSize
RResolver/RAlgorithmsShort.h:164
↓ 1 callers
Class
RollingBloomDBGVertex
* Represents a vertex in the de Bruijn graph. */
BloomDBG/RollingBloomDBG.h:33
↓ 1 callers
Class
RollingHashIterator
* Iterate over hash values for k-mers in a * given DNA sequence. * * This implementation uses a rolling hash * function to efficiently calculate
BloomDBG/RollingHashIterator.h:28
↓ 1 callers
Class
Rotation
DAssembler/Rotation.h:9
↓ 1 callers
Class
SAMAlignment
A SAM alignment of a single query. */
Common/SAM.h:21
↓ 1 callers
Class
Timer
* Time the duration between the construction and destruction of this * timer object and log that duration. */
Common/Timer.h:10
↓ 1 callers
Class
Vertex
Graph/DirectedGraph.h:16
↓ 1 callers
Class
WhiteMap
A color map that always returns white. */
FMIndex/count.cc:65
↓ 1 callers
Enum
extDirection
Common/Sense.h:6
↓ 1 callers
Class
is_edge_inconsistent
Return whether the specified edge is inconsistent. */
FilterGraph/FilterGraph.cc:564
↓ 1 callers
Class
overlap_align
overlap alignment between two sequences t and h */
Align/smith_waterman.h:34
↓ 1 callers
Class
sigaction
Common/SignalHandler.cpp:57
↓ 1 callers
Class
sortContigs
Functor used for sorting contigs based on degree, then size, * and then ID. */
FilterGraph/FilterGraph.cc:419
↓ 1 callers
Class
stat
KAligner/KAligner.cpp:103
next →
1–100 of 463, ranked by callers