- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
0219-3116
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A meta-algorithm for finding large k-plexes ; volume:63 ; number:7 ; day:1 ; month:5 ; year:2021 ; pages:1745-1769 ; date:7.2021
Knowledge and information systems ; 63, Heft 7 (1.5.2021), 1745-1769, 7.2021
- Creator
-
Conte, Alessio
Firmani, Donatella
Patrignani, Maurizio
Torlone, Riccardo
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10115-021-01570-8
- URN
-
urn:nbn:de:101:1-2021100719243641674300
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.1091, 6:38 AM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Conte, Alessio
- Firmani, Donatella
- Patrignani, Maurizio
- Torlone, Riccardo
- SpringerLink (Online service)
Other Objects (12)
A fast algorithm for finding the confidence set of large collections of models
Multiple organism algorithm for finding ultraconserved elements
Kavosh : a new algorithm for finding network motifs
A deterministic algorithm for finding r-power divisors
XGANDALF – extended gradient descent algorithm for lattice finding
Kavosh: a new algorithm for finding network motifs
A One Pass Streaming Algorithm for Finding Euler Tours
A One Pass Streaming Algorithm for Finding Euler Tours
Finding reproducible cluster partitions for the k-means algorithm
Efficient motif finding algorithms for large-alphabet inputs
Finding eigenvectors with a quantum variational algorithm
A particle swarm optimization-based algorithm for finding gapped motifs
A fast algorithm for finding the confidence set of large collections of models
Multiple organism algorithm for finding ultraconserved elements
Kavosh : a new algorithm for finding network motifs
A deterministic algorithm for finding r-power divisors
XGANDALF – extended gradient descent algorithm for lattice finding
Kavosh: a new algorithm for finding network motifs
A One Pass Streaming Algorithm for Finding Euler Tours
A One Pass Streaming Algorithm for Finding Euler Tours
Finding reproducible cluster partitions for the k-means algorithm
Efficient motif finding algorithms for large-alphabet inputs
Finding eigenvectors with a quantum variational algorithm
A particle swarm optimization-based algorithm for finding gapped motifs
A fast algorithm for finding the confidence set of large collections of models
Multiple organism algorithm for finding ultraconserved elements
Kavosh : a new algorithm for finding network motifs
A deterministic algorithm for finding r-power divisors
XGANDALF – extended gradient descent algorithm for lattice finding
Kavosh: a new algorithm for finding network motifs
A One Pass Streaming Algorithm for Finding Euler Tours
A One Pass Streaming Algorithm for Finding Euler Tours
Finding reproducible cluster partitions for the k-means algorithm
Efficient motif finding algorithms for large-alphabet inputs
Finding eigenvectors with a quantum variational algorithm